{"meta":{"query_hash":"40f29b27c88c","filters":{"venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)"},"cohort_total":463,"direct_labels_cover":0,"predictions_cover":463,"exported":463,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/40f29b27c88c","api":"https://metacan.xera.ac/api/v1/cohort?venue=DROPS+%28Schloss+Dagstuhl+%E2%80%93+Leibniz+Center+for+Informatics%29"},"results":[{"id":"W1484385501","doi":"10.4230/lipics.tqc.2013.80","title":"Dequantizing Read-once Quantum Formulas","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":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Army Research Office; Ontario Ministry of Research and Innovation; Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Toffoli gate; Qubit; Quantum circuit; Quantum gate; Quantum; Mathematics; Quantum computer; Quantum algorithm; Discrete mathematics; Quantum error correction; Computer science; Quantum mechanics; Physics","score_opus":0.018988195329939568,"score_gpt":0.26012099073690825,"score_spread":0.2411327954069687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484385501","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17489932,0.00031709744,0.81179744,0.00096701307,0.0055249603,0.0024906707,0.00043429792,0.0012108787,0.002358323],"genre_scores_gemma":[0.567097,0.00018572026,0.42674497,0.0024422617,0.001272497,0.00050674117,0.00097627926,0.00023721733,0.00053730916],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99321854,0.00011074498,0.0024445257,0.0011039901,0.0011583298,0.001963888],"domain_scores_gemma":[0.9937007,0.00044123008,0.0016611044,0.002992037,0.0006694682,0.000535464],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0011656393,0.0013296164,0.0013879474,0.0006791714,0.00083954557,0.0025148634,0.0052180747,0.0009711144,0.00002886866],"category_scores_gemma":[0.00021483273,0.0011847239,0.0009191347,0.0005063335,0.00019654515,0.001693636,0.0062270565,0.0026214467,0.00037915376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021469072,0.0018005014,0.00235196,0.014749247,0.0022808546,0.00016528546,0.07052297,0.06926711,0.00027431746,0.33975974,0.04234648,0.45626685],"study_design_scores_gemma":[0.0012935866,0.0002390596,0.0002044446,0.0010962337,0.000051083745,0.00014674402,0.0002189164,0.9243122,0.000292498,0.026408145,0.044301584,0.0014355171],"about_ca_topic_score_codex":0.00011296276,"about_ca_topic_score_gemma":0.000011599101,"teacher_disagreement_score":0.8550451,"about_ca_system_score_codex":0.00026075292,"about_ca_system_score_gemma":0.00037684516,"threshold_uncertainty_score":0.9999455},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.020529046347228297,"score_gpt":0.2652369112787808,"score_spread":0.2447078649315525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1499762049","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5497877,0.000071698334,0.43384677,0.0012232299,0.0016424617,0.0019815597,0.00004750631,0.00044490988,0.010954131],"genre_scores_gemma":[0.9507595,0.000027076676,0.04707654,0.0012482267,0.00011154165,0.00031239688,0.000034324803,0.000032628268,0.00039780862],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996852,0.000041403382,0.0012954244,0.00033907115,0.00047919014,0.0009929391],"domain_scores_gemma":[0.99802697,0.00024761804,0.00034903645,0.00091914274,0.00024783128,0.00020943226],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00058500306,0.00036396756,0.00041177732,0.00045573243,0.00020809134,0.0008232355,0.0018603283,0.00021400576,0.00010659391],"category_scores_gemma":[0.00020883585,0.00033144196,0.00019093983,0.00057595974,0.00012947636,0.0039518056,0.0005879156,0.00042508967,0.0014500972],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058768273,0.0010791452,0.102789015,0.0007573256,0.00018481491,0.00003580471,0.0916035,0.0015319753,0.000979768,0.18921162,0.02559732,0.586171],"study_design_scores_gemma":[0.0018955526,0.00050858746,0.012219359,0.00053193,0.000019796043,0.00010111289,0.007815047,0.8378653,0.016733965,0.042997286,0.07729587,0.0020161695],"about_ca_topic_score_codex":0.000121264275,"about_ca_topic_score_gemma":0.000051899908,"teacher_disagreement_score":0.83633333,"about_ca_system_score_codex":0.00016805316,"about_ca_system_score_gemma":0.0000774644,"threshold_uncertainty_score":0.99991375},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.029408539778234634,"score_gpt":0.2561213773527595,"score_spread":0.2267128375745249,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1502375285","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036527922,0.00061489735,0.9883976,0.000016226371,0.00087807677,0.0028484885,0.0022507536,0.0006812837,0.0006598716],"genre_scores_gemma":[0.05168753,0.00009996754,0.9441253,0.000062458865,0.00018922934,0.0007827223,0.0026108853,0.00028064547,0.00016125444],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962799,0.0000217607,0.001858285,0.00043913943,0.00049809477,0.00090281846],"domain_scores_gemma":[0.99719983,0.000085059895,0.0008945358,0.00070143584,0.0008629894,0.0002561464],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059491704,0.0009373976,0.0011736003,0.00051443133,0.00021372606,0.00030390476,0.0008282456,0.0007103901,0.000029446659],"category_scores_gemma":[0.000072242256,0.0008301769,0.00039018277,0.00028670137,0.00015783016,0.00065930537,0.00034148063,0.0010362422,0.000015183655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001669265,0.0005781429,0.000541155,0.016883695,0.0012564609,0.0000027987496,0.024306893,0.85050845,0.000029106066,0.00029626815,0.00011503674,0.105315074],"study_design_scores_gemma":[0.0038662925,0.00022325058,0.000018625038,0.0018703847,0.00022725319,0.000022551585,0.00095396506,0.98963445,0.0013694888,0.0001435969,0.0006838482,0.0009862671],"about_ca_topic_score_codex":0.000022608285,"about_ca_topic_score_gemma":0.000017196842,"teacher_disagreement_score":0.13912603,"about_ca_system_score_codex":0.00014965665,"about_ca_system_score_gemma":0.00020675159,"threshold_uncertainty_score":0.9994149},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0355182454461572,"score_gpt":0.25757044018515357,"score_spread":0.22205219473899637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537398137","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014996011,0.00026223838,0.9159499,0.00033193213,0.006036616,0.008169426,0.00022429902,0.006177687,0.047851883],"genre_scores_gemma":[0.95318437,0.000025132113,0.04269198,0.00052942307,0.00031667927,0.0010463445,0.0008325891,0.00012559525,0.0012479029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99489856,0.00009727033,0.0018195113,0.00086657534,0.00092657283,0.0013915023],"domain_scores_gemma":[0.99458015,0.0000862259,0.0015381917,0.002677069,0.00069833035,0.00042000567],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00093137805,0.0010477494,0.0011700802,0.0004747384,0.0004189696,0.0014934295,0.003721653,0.00090387196,0.000030053541],"category_scores_gemma":[0.00006439066,0.0007939652,0.0004616722,0.0004400285,0.0002191408,0.0013693979,0.002376179,0.0011890201,0.00043216872],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001033699,0.0040382193,0.014748511,0.02245416,0.005249979,0.00027302915,0.13835518,0.0014763986,0.00007266588,0.6524838,0.065072015,0.09474232],"study_design_scores_gemma":[0.01070668,0.0028378759,0.0022364792,0.0010801234,0.0005145938,0.0007352244,0.0015197778,0.6130723,0.0037170725,0.04999034,0.30669078,0.0068987515],"about_ca_topic_score_codex":0.00016085297,"about_ca_topic_score_gemma":0.000060945345,"teacher_disagreement_score":0.9381883,"about_ca_system_score_codex":0.00023137458,"about_ca_system_score_gemma":0.00046017778,"threshold_uncertainty_score":0.99954313},"labels":[],"label_agreement":null},{"id":"W1554455557","doi":"10.4230/lipics.ccc.2018.15","title":"Hardness of Function Composition for Semantic Read once Branching Programs","year":2013,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tree (set theory); Branching (polymer chemistry); Bottleneck; Computer science; Argument (complex analysis); Upper and lower bounds; Discrete mathematics; Mathematics; Theoretical computer science; Tree traversal; Combinatorics; Algorithm","score_opus":0.03285590300738768,"score_gpt":0.2686928816787141,"score_spread":0.2358369786713264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554455557","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050175358,0.00009575732,0.93907064,0.0002123489,0.0046970816,0.004155806,0.00048200454,0.00038416142,0.00072681095],"genre_scores_gemma":[0.6664422,0.000057972826,0.32766908,0.0004763996,0.00047704933,0.0014643053,0.0031324476,0.00008972034,0.00019082658],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959284,0.00006809004,0.0018368164,0.0006130567,0.0007145646,0.0008390701],"domain_scores_gemma":[0.99567324,0.00019839106,0.0015232975,0.0015225176,0.000889523,0.00019303049],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00086352235,0.000674317,0.0010140438,0.00046325382,0.00048378445,0.0009866487,0.0021865207,0.0005223177,0.000011713422],"category_scores_gemma":[0.00005137434,0.0006614453,0.0007466668,0.0003627379,0.00020393508,0.0018296357,0.0015901793,0.0008461139,0.00002779817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064235955,0.003121409,0.0021820315,0.0345352,0.002022884,0.0000044908816,0.03171713,0.0045963954,0.00052169495,0.20231381,0.008062231,0.71028036],"study_design_scores_gemma":[0.0033718692,0.0008557713,0.00079212687,0.0031011866,0.0002127792,0.0000488378,0.00047833554,0.90686,0.0010850402,0.060335584,0.02143294,0.0014255324],"about_ca_topic_score_codex":0.00008680484,"about_ca_topic_score_gemma":0.000017445991,"teacher_disagreement_score":0.9022636,"about_ca_system_score_codex":0.00014997185,"about_ca_system_score_gemma":0.00015113202,"threshold_uncertainty_score":0.99958366},"labels":[],"label_agreement":null},{"id":"W1558380859","doi":"10.4230/dagsemproc.07461.6","title":"Erlangian Approximation to Finite Time Ruin Probabilities in Perturbed Risk Models","year":2008,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Probability and Risk Models","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Markov process; Mathematics; Risk model; Phase-type distribution; Markov chain; Applied mathematics; Type (biology); First-hitting-time model; Ruin theory; Work (physics); Risk process; Stochastic process; Mathematical economics; Mathematical optimization; Statistics; Engineering","score_opus":0.09017863011510477,"score_gpt":0.3135910623283894,"score_spread":0.22341243221328463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1558380859","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82417035,0.00005065369,0.15979858,0.00075255724,0.00039487437,0.0031960888,0.0012352472,0.0001916406,0.0102099925],"genre_scores_gemma":[0.95864004,0.000049869777,0.03603911,0.0009969012,0.00012084448,0.000271925,0.00027132296,0.00005149854,0.003558493],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940021,0.00023918747,0.0025557014,0.000604327,0.0016346249,0.0009640711],"domain_scores_gemma":[0.99559814,0.0013597149,0.0006330709,0.0013725383,0.00067435607,0.00036218992],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.004036408,0.00049298594,0.00085072726,0.00090061896,0.00047338466,0.00039508697,0.0014793692,0.00035713168,0.00014426712],"category_scores_gemma":[0.0029871638,0.00037294996,0.00039778353,0.0010765507,0.00028398816,0.0031713159,0.00042125845,0.0005444466,0.0016094557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021726328,0.002612945,0.045152582,0.0007375253,0.00025078273,0.000024285908,0.3984315,0.44484416,0.00012464508,0.024221066,0.032312334,0.04911555],"study_design_scores_gemma":[0.0021776569,0.00032014633,0.0017970827,0.00010612567,0.00001885703,0.00003363041,0.0025470646,0.87389416,0.00020897688,0.10413611,0.014085289,0.0006749035],"about_ca_topic_score_codex":0.00009937669,"about_ca_topic_score_gemma":0.00013914776,"teacher_disagreement_score":0.42905,"about_ca_system_score_codex":0.00026918502,"about_ca_system_score_gemma":0.00019797149,"threshold_uncertainty_score":0.99987227},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.023628448558856565,"score_gpt":0.2844284748760495,"score_spread":0.26080002631719296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1567455550","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04646928,0.00008340979,0.9429661,0.0005054849,0.00062044075,0.0018552691,0.00011438641,0.0006151048,0.0067705256],"genre_scores_gemma":[0.90891486,0.000096630676,0.08782146,0.0009787603,0.00021299548,0.00061138225,0.00033769757,0.00009570569,0.00093050074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99548745,0.0001508937,0.0013269355,0.000622484,0.0010378283,0.0013743965],"domain_scores_gemma":[0.99583465,0.00039028234,0.00059184345,0.002141035,0.0006075091,0.0004346735],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019954888,0.0005665847,0.0005725568,0.0006958571,0.00067692914,0.0006599437,0.0030530975,0.00029346463,0.000019218427],"category_scores_gemma":[0.00029153057,0.00051969173,0.00035460424,0.0011103525,0.0002985508,0.003304133,0.0007662395,0.0006706336,0.00040951173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020699964,0.0013657238,0.005195152,0.0013578682,0.00033874917,0.000006690239,0.01892335,0.0045292205,0.0019257615,0.80366254,0.01068839,0.15179954],"study_design_scores_gemma":[0.0062403358,0.0016422586,0.0018434227,0.00043816827,0.00005647388,0.00015530104,0.00094271306,0.54120016,0.007932916,0.16270521,0.2746164,0.0022266577],"about_ca_topic_score_codex":0.00001165458,"about_ca_topic_score_gemma":0.000006826866,"teacher_disagreement_score":0.8624456,"about_ca_system_score_codex":0.00015298631,"about_ca_system_score_gemma":0.00007424093,"threshold_uncertainty_score":0.99972546},"labels":[],"label_agreement":null},{"id":"W1577042948","doi":"10.4230/lipics.ccc.2017.16","title":"Information complexity is computable","year":2015,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computable general equilibrium; Computer science; Economics; Microeconomics","score_opus":0.05894242586725465,"score_gpt":0.29261671203688366,"score_spread":0.23367428616962901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1577042948","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019427884,0.0001231637,0.95241874,0.0017146199,0.006652889,0.0041419016,0.0029715912,0.0014544261,0.011094803],"genre_scores_gemma":[0.20829543,0.00008366724,0.77225286,0.0091811875,0.0012157444,0.0007925445,0.0075723073,0.00017284743,0.00043338162],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9920818,0.00016053826,0.0033723328,0.00077447697,0.0019017562,0.0017090945],"domain_scores_gemma":[0.99069506,0.0002741815,0.0020442838,0.0037642284,0.002451934,0.00077032775],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["metaepi_narrow","open_science"],"category_scores_codex":[0.0024227998,0.0013673162,0.0017011451,0.00083922886,0.0005814537,0.003176591,0.006146108,0.0011121435,0.000070391674],"category_scores_gemma":[0.00026707677,0.0013461444,0.0008199657,0.00076693326,0.00040948272,0.0056161555,0.010597053,0.0020810484,0.0009230132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041331584,0.0031069973,0.006116129,0.014297471,0.0019277479,0.0000250936,0.15603255,0.048719864,0.000006022532,0.10252962,0.4285978,0.23822738],"study_design_scores_gemma":[0.002367268,0.00026415434,0.00044972546,0.0002343416,0.000055718712,0.000077476725,0.0004955514,0.7623255,0.000090410365,0.056077674,0.17616466,0.0013975059],"about_ca_topic_score_codex":0.00019797531,"about_ca_topic_score_gemma":0.00002314037,"teacher_disagreement_score":0.71360564,"about_ca_system_score_codex":0.0010747198,"about_ca_system_score_gemma":0.0009686549,"threshold_uncertainty_score":0.99990773},"labels":[],"label_agreement":null},{"id":"W1579882491","doi":"10.4230/dagrep.3.11.29","title":"Proxemics in Human-Computer Interaction (Dagstuhl Seminar 13452)","year":2014,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Context-Aware Activity Recognition Systems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Proxemics; Interpersonal communication; Human–computer interaction; Context (archaeology); Computer science; Psychology; Social psychology; Geography","score_opus":0.018355246281505776,"score_gpt":0.27388411488478304,"score_spread":0.2555288686032773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1579882491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2389086,0.000015927379,0.74984777,0.00039008594,0.0024001275,0.0017342414,0.00006604911,0.0005000288,0.006137162],"genre_scores_gemma":[0.9732401,0.0000082944825,0.024026982,0.0012752955,0.000504826,0.00030418418,0.00021351395,0.000061465114,0.00036534038],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958296,0.00017374178,0.0017529937,0.0005992588,0.0006784763,0.000965928],"domain_scores_gemma":[0.996799,0.0004481693,0.0008177608,0.0012536176,0.00042623482,0.00025519758],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014805795,0.0005822751,0.0007642524,0.0007409616,0.00034822043,0.0008690624,0.0016345297,0.00035253225,0.000026299589],"category_scores_gemma":[0.00012998517,0.00058167806,0.00032506665,0.0006332196,0.0000956096,0.0043750443,0.00072785,0.000771639,0.00034995296],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036420417,0.0033010703,0.0453425,0.0033718038,0.00063343084,0.00004865037,0.06711437,0.0016057448,0.0024054316,0.04450767,0.030854037,0.8004511],"study_design_scores_gemma":[0.00795144,0.0011605206,0.0039930195,0.0013001447,0.000048778358,0.00046609557,0.0014241402,0.72588474,0.004496417,0.002776011,0.24835888,0.0021398347],"about_ca_topic_score_codex":0.00006470669,"about_ca_topic_score_gemma":0.000118359065,"teacher_disagreement_score":0.79831123,"about_ca_system_score_codex":0.00038661782,"about_ca_system_score_gemma":0.00008191655,"threshold_uncertainty_score":0.9996635},"labels":[],"label_agreement":null},{"id":"W1591207959","doi":"10.4230/lipics.fsttcs.2009.2319","title":"On the Tightening of the Standard SDP for Vertex Cover with $ell_1$ Inequalities","year":2009,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Cover (algebra); Mathematics; Vertex (graph theory); Combinatorics; Upper and lower bounds; Vertex cover; Regular polygon; Inequality; Metric (unit); Discrete mathematics; Approximation algorithm; Mathematical analysis; Geometry; Graph","score_opus":0.01935012980026356,"score_gpt":0.27016689915421316,"score_spread":0.2508167693539496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1591207959","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15272133,0.000046915062,0.8360643,0.0021817465,0.00036431834,0.00261141,0.00050882396,0.00012581468,0.0053753355],"genre_scores_gemma":[0.9812656,0.000011775566,0.015774038,0.0021294479,0.00004141918,0.00011899864,0.000025865946,0.000027322389,0.00060554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99748105,0.00008002673,0.00068035466,0.0002286065,0.00085894164,0.00067104335],"domain_scores_gemma":[0.99686867,0.0009678817,0.00040193996,0.0012172443,0.00044628364,0.000097973745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010576751,0.00030254023,0.0003660774,0.00015034745,0.0005469974,0.00026143368,0.0020562827,0.000094869356,0.00001432734],"category_scores_gemma":[0.00026415696,0.00015684597,0.00023866641,0.00047060827,0.00027285042,0.0010049713,0.00026278332,0.00036997904,0.000015100413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006902334,0.00010992243,0.0003027112,0.00017337578,0.00010924234,9.4257354e-7,0.0074771345,0.0009333562,0.00008061669,0.9779983,0.0035308949,0.008593243],"study_design_scores_gemma":[0.014102337,0.008792555,0.0015318587,0.0016698404,0.00011749149,0.00008240284,0.005739845,0.1947747,0.050244413,0.5709981,0.1499933,0.0019531513],"about_ca_topic_score_codex":0.0000020652087,"about_ca_topic_score_gemma":0.000002991253,"teacher_disagreement_score":0.82854426,"about_ca_system_score_codex":0.00009721014,"about_ca_system_score_gemma":0.00013287856,"threshold_uncertainty_score":0.6395993},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.014599000787750742,"score_gpt":0.2688054297050613,"score_spread":0.2542064289173106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1599413552","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014014108,0.00019274578,0.9747109,0.0011183766,0.003319461,0.0049194214,0.0010166256,0.00061614683,0.00009223949],"genre_scores_gemma":[0.071755484,0.000080369966,0.92186743,0.0008353213,0.001164966,0.002152324,0.0017219492,0.00014890597,0.00027326186],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99509364,0.00009952352,0.0019033357,0.00089376065,0.0008097935,0.0011999503],"domain_scores_gemma":[0.9941186,0.0004399367,0.0014649848,0.0027744484,0.00089139224,0.00031068636],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016946696,0.00083990727,0.00075739966,0.00033415962,0.0011435953,0.0034394497,0.005311303,0.00058610796,0.000012134332],"category_scores_gemma":[0.00006968037,0.0006329465,0.0006172951,0.00033799338,0.0001972579,0.0015411546,0.0020205847,0.0013309243,0.00009424654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042907897,0.0006446189,0.000041711257,0.0014100544,0.0004947617,0.0000030247916,0.016570529,0.06186835,0.000040659448,0.014983212,0.009431492,0.89446867],"study_design_scores_gemma":[0.0010186126,0.00030083372,0.00016922847,0.00020674361,0.00007272499,0.000042970398,0.00037866217,0.9629656,0.0003180634,0.009042934,0.024673982,0.0008096657],"about_ca_topic_score_codex":0.000061318904,"about_ca_topic_score_gemma":0.000005251909,"teacher_disagreement_score":0.90109724,"about_ca_system_score_codex":0.0001496313,"about_ca_system_score_gemma":0.00028422865,"threshold_uncertainty_score":0.9996122},"labels":[],"label_agreement":null},{"id":"W1810597274","doi":"10.4230/lipics.approx-random.2015.915","title":"Separating Decision Tree Complexity from Subcube Partition Complexity","year":2015,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Upper and lower bounds; Mathematics; Combinatorics; Partition (number theory); Computational complexity theory; Discrete mathematics; Randomized algorithm; Time complexity; Algorithm","score_opus":0.1036924692433647,"score_gpt":0.32258378775563157,"score_spread":0.21889131851226687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1810597274","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13689575,0.00020840645,0.8420474,0.000596584,0.0055625713,0.0022823296,0.005561805,0.00097079296,0.005874379],"genre_scores_gemma":[0.3313659,0.00006800487,0.6572801,0.001246835,0.00097305916,0.0003614842,0.008499615,0.000107025575,0.00009795884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9926248,0.000219268,0.002815982,0.0011960408,0.0017270015,0.0014168646],"domain_scores_gemma":[0.9926059,0.0006675043,0.0016963179,0.0032223111,0.0011238254,0.00068414287],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017903997,0.0012358634,0.0016201384,0.0005526606,0.0009544059,0.0021788354,0.004823443,0.0008969892,0.000095388816],"category_scores_gemma":[0.00034151901,0.0012329841,0.00092994404,0.00060650817,0.0006434596,0.0022558845,0.0063436436,0.002052574,0.00032175996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001356619,0.00454521,0.010219573,0.0037469573,0.0024399369,0.000116637246,0.06112311,0.0103354575,0.0000832873,0.4042608,0.14973311,0.35203928],"study_design_scores_gemma":[0.0024585433,0.00021669095,0.0018085353,0.0005999548,0.00007147886,0.000029685401,0.00036682247,0.5920284,0.00017587803,0.38139522,0.019612925,0.0012358488],"about_ca_topic_score_codex":0.0004873847,"about_ca_topic_score_gemma":0.0008144978,"teacher_disagreement_score":0.58169293,"about_ca_system_score_codex":0.0005528189,"about_ca_system_score_gemma":0.0004404707,"threshold_uncertainty_score":0.999012},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02642885969981242,"score_gpt":0.2678502540887758,"score_spread":0.24142139438896335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1895441878","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46300748,0.0000075862667,0.53616905,0.000013165555,0.00021727933,0.000388206,0.000021164566,0.00008268787,0.00009339606],"genre_scores_gemma":[0.9110852,0.0000026516045,0.088798776,0.000037268343,0.00003111316,0.000002228006,0.000014846276,0.000015401214,0.000012525036],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789107,0.000035360674,0.0005855042,0.00023031981,0.00058194064,0.00067583035],"domain_scores_gemma":[0.9982924,0.00053720595,0.00022298328,0.00054591807,0.0002573428,0.0001441682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016455533,0.00021372564,0.00028681883,0.0014060328,0.00012661738,0.00009080245,0.00089821045,0.00025159368,0.0000021888873],"category_scores_gemma":[0.0005446127,0.00023450867,0.00013570437,0.001864572,0.00007641746,0.000880409,0.00027041044,0.00056180294,0.0000046675264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016759769,0.0028762133,0.80057025,0.004969867,0.0004704914,0.00027367374,0.025938999,0.05098088,0.012884364,0.009634706,0.00037302743,0.089351535],"study_design_scores_gemma":[0.0043713944,0.0004620066,0.060002714,0.0001662245,0.000020286228,0.000034203174,0.0006635454,0.85824835,0.07218451,0.00012763654,0.0031060816,0.00061306026],"about_ca_topic_score_codex":0.000160559,"about_ca_topic_score_gemma":0.00011556241,"teacher_disagreement_score":0.8072674,"about_ca_system_score_codex":0.00053457,"about_ca_system_score_gemma":0.00018801077,"threshold_uncertainty_score":0.9562986},"labels":[],"label_agreement":null},{"id":"W1942339129","doi":"10.4230/dagsemproc.05151.9","title":"Temporal information extraction from legal documents","year":2005,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thomson Reuters (Canada)","funders":"","keywords":"Computer science; Information extraction; Statute; Transactional leadership; Information retrieval; Political science; Law","score_opus":0.010853852381888143,"score_gpt":0.26421046648498087,"score_spread":0.25335661410309274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1942339129","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25712445,0.00005608342,0.7262555,0.0018688112,0.0021781977,0.0009679764,0.00021187449,0.0006748159,0.010662315],"genre_scores_gemma":[0.8760706,0.000028976421,0.12046128,0.0021904856,0.00029341815,0.000080379476,0.00058739394,0.000015840063,0.0002715928],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973193,0.000030033907,0.0011908398,0.00022184294,0.0006000372,0.00063796155],"domain_scores_gemma":[0.9981369,0.00012134742,0.00056206365,0.00078514486,0.00022449474,0.0001700539],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.00040735697,0.00035080247,0.00035383613,0.00028085243,0.0003279931,0.0011413661,0.0012100118,0.00023359482,0.000053833828],"category_scores_gemma":[0.00009355265,0.00031260142,0.00020155768,0.0002540976,0.000067589135,0.015278439,0.0003427397,0.0003337551,0.0008133075],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044656883,0.0010626903,0.04228984,0.0005322831,0.00063292077,0.000018221324,0.035507448,0.0013158814,0.0003050554,0.091059476,0.086551264,0.74027836],"study_design_scores_gemma":[0.0036136743,0.00021008628,0.00814605,0.000090536065,0.00003572171,0.00006934458,0.0012943408,0.15934241,0.003036065,0.0018362409,0.8215834,0.0007421541],"about_ca_topic_score_codex":0.00021938527,"about_ca_topic_score_gemma":0.00008795904,"teacher_disagreement_score":0.7395362,"about_ca_system_score_codex":0.00018187248,"about_ca_system_score_gemma":0.00009382844,"threshold_uncertainty_score":0.99996465},"labels":[],"label_agreement":null},{"id":"W202943302","doi":"10.4230/dagsemproc.05321.11","title":"Iterated Belief Change and the Levi Identity","year":2005,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Iterated function; Belief revision; Identity (music); Mathematics; Computer science; Set (abstract data type); Epistemology; Mathematical economics; Artificial intelligence; Philosophy","score_opus":0.0285557793842919,"score_gpt":0.25975007583539717,"score_spread":0.23119429645110526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W202943302","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31639504,0.0034966671,0.59473383,0.010926128,0.004557969,0.006808461,0.00037359283,0.0014673269,0.061240956],"genre_scores_gemma":[0.98255515,0.00026748766,0.010726634,0.0046109604,0.00060502905,0.00023830713,0.000078844605,0.000028892046,0.00088872225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977655,0.00006987941,0.00075795193,0.00028989502,0.00042201835,0.0006947845],"domain_scores_gemma":[0.99820507,0.00018125438,0.00034134524,0.00079694216,0.00027608563,0.000199334],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010820299,0.00035474604,0.000425229,0.00016425815,0.000606174,0.0011311587,0.0014695694,0.00016810988,0.000027163618],"category_scores_gemma":[0.00013031875,0.00023559172,0.00020200676,0.0004021503,0.00025288953,0.0046065347,0.00081299536,0.0003491709,0.0002832353],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020843052,0.00054496876,0.0083951065,0.0005855179,0.00031701606,0.000009251927,0.107405424,0.000025635263,0.000025369738,0.7277454,0.013573694,0.1411642],"study_design_scores_gemma":[0.015036462,0.0003784839,0.0085105635,0.0002544413,0.00010713527,0.00028370533,0.0010013004,0.38160932,0.00054967427,0.008736038,0.58218515,0.0013477288],"about_ca_topic_score_codex":0.000032775188,"about_ca_topic_score_gemma":0.000110355766,"teacher_disagreement_score":0.71900934,"about_ca_system_score_codex":0.00008172161,"about_ca_system_score_gemma":0.00004434908,"threshold_uncertainty_score":0.99990577},"labels":[],"label_agreement":null},{"id":"W2070894968","doi":"10.4230/lipics.stacs.2014.300","title":"From Small Space to Small Width in Resolution","year":2014,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Vetenskapsrådet; Kungliga Tekniska Högskolan; University of Toronto; European Commission","keywords":"Resolution (logic); Upper and lower bounds; Space (punctuation); Proof complexity; Mathematics; Simple (philosophy); Polynomial; Measure (data warehouse); PSPACE; Discrete mathematics; Product (mathematics); Calculus (dental); Algorithm; Computer science; Combinatorics; Computational complexity theory; Mathematical proof; Mathematical analysis; Geometry; Artificial intelligence","score_opus":0.022146874275755426,"score_gpt":0.23658082300295133,"score_spread":0.2144339487271959,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070894968","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079431474,0.000036959344,0.90931255,0.000678424,0.0015235851,0.0011558534,0.000029857401,0.00028866492,0.0075426446],"genre_scores_gemma":[0.9156415,0.0000064293195,0.08197574,0.0011908461,0.0003704661,0.00014702803,0.00014054436,0.000033368582,0.0004941038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972437,0.00009297887,0.0009784366,0.00042521194,0.0003721589,0.0008874949],"domain_scores_gemma":[0.99791265,0.0001730066,0.00034444185,0.001086901,0.00018341216,0.00029962067],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010805476,0.0003699121,0.00047753146,0.00032977853,0.00019349578,0.0005620641,0.0015181599,0.0002443307,0.000008436218],"category_scores_gemma":[0.00019481467,0.00032985338,0.0001723925,0.0004906552,0.00005356345,0.00077846943,0.0005662786,0.00032219492,0.00046945323],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031115665,0.0010730615,0.04022079,0.0009908096,0.00024641425,0.000027465321,0.08607465,0.0018462006,0.00034109553,0.64348334,0.013165019,0.21222003],"study_design_scores_gemma":[0.005439208,0.0010266528,0.0068264124,0.00017537065,0.000033518303,0.00003877617,0.0012625706,0.25950164,0.0013602554,0.035474945,0.68733203,0.001528622],"about_ca_topic_score_codex":0.0006349184,"about_ca_topic_score_gemma":0.00080289814,"teacher_disagreement_score":0.83621,"about_ca_system_score_codex":0.00017213951,"about_ca_system_score_gemma":0.000063326064,"threshold_uncertainty_score":0.99991536},"labels":[],"label_agreement":null},{"id":"W2095921276","doi":"10.4230/lipics.socg.2020.33","title":"Finding Closed Quasigeodesics on Convex Polyhedra","year":2010,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Geometry; Computer science; Computational geometry; Mathematics","score_opus":0.030150585440336095,"score_gpt":0.29114968372529654,"score_spread":0.26099909828496043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095921276","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14017761,0.0000508867,0.84355223,0.0009553049,0.0077199508,0.0018653403,0.0006223935,0.00047192667,0.0045843646],"genre_scores_gemma":[0.86131597,0.00004975132,0.1303823,0.0032219507,0.0010636037,0.00030842295,0.0027789401,0.00008478654,0.00079428783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99573696,0.00007549989,0.0015508024,0.0007055991,0.0010403794,0.0008907722],"domain_scores_gemma":[0.9959862,0.00042271998,0.0010646329,0.0016333194,0.0005576062,0.00033550488],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009930844,0.00078601437,0.0007707554,0.0007552475,0.0005672574,0.00138306,0.0024011151,0.00093580753,0.000039234805],"category_scores_gemma":[0.00022067863,0.0007767533,0.0005220329,0.00045110923,0.00010957698,0.001124133,0.0015275747,0.0020242508,0.00029284685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055303605,0.0023547066,0.0016503034,0.004448223,0.0012861511,0.000051060502,0.031423137,0.065192126,0.0011046319,0.6059468,0.034943424,0.2510464],"study_design_scores_gemma":[0.0034588524,0.0004613043,0.0011844126,0.0005366576,0.00008294873,0.00006482283,0.00021162674,0.8601594,0.0061593805,0.021857442,0.10387006,0.0019530786],"about_ca_topic_score_codex":0.000015872647,"about_ca_topic_score_gemma":0.000014502843,"teacher_disagreement_score":0.7949673,"about_ca_system_score_codex":0.00022600769,"about_ca_system_score_gemma":0.00048745036,"threshold_uncertainty_score":0.9996536},"labels":[],"label_agreement":null},{"id":"W2134543674","doi":"10.4230/lipics.stacs.2013.269","title":"Algorithms for Designing Pop-Up Cards","year":2013,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Division of Chemical, Bioengineering, Environmental, and Transport Systems; Natural Sciences and Engineering Research Council of Canada; Air Force Office of Scientific Research; Defense Advanced Research Projects Agency; Deutsche Forschungsgemeinschaft; Division of Emerging Frontiers in Research and Innovation; National Science Foundation","keywords":"Polygon (computer graphics); Polyhedron; Simple polygon; Closing (real estate); Computer science; Simple (philosophy); Combinatorics; Linkage (software); Mathematics; Algorithm; Computer graphics (images); Regular polygon; Geometry","score_opus":0.025406681989880116,"score_gpt":0.2709988723429491,"score_spread":0.245592190353069,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134543674","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01734612,0.000051408515,0.9770514,0.0005100455,0.0019130339,0.0017333623,0.00011720238,0.00021960992,0.0010578107],"genre_scores_gemma":[0.3443434,0.000014536428,0.6495937,0.002078177,0.00056909875,0.00095823733,0.000694437,0.000045075558,0.0017033246],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976983,0.000030361367,0.00084018667,0.0003076455,0.00046054926,0.0006629762],"domain_scores_gemma":[0.9979873,0.00025528023,0.00030767522,0.00052575814,0.0007071846,0.0002168212],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005822314,0.00031540703,0.00032959308,0.00030029312,0.00048053052,0.00079273846,0.00090161036,0.00016079108,0.000026828735],"category_scores_gemma":[0.00012469571,0.00029452986,0.0002522424,0.00041074873,0.00004615382,0.0026758285,0.00024564596,0.00018772409,0.00018632837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010670211,0.0005471391,0.0012433312,0.0011435172,0.00054979615,0.0000035398102,0.020469174,0.011106432,0.0017287519,0.10915255,0.13177808,0.722171],"study_design_scores_gemma":[0.0027084625,0.00036172138,0.00056581706,0.0000621918,0.000027859329,0.000045215427,0.00045043006,0.89535385,0.005480727,0.0077872067,0.08653248,0.00062404876],"about_ca_topic_score_codex":0.000019192279,"about_ca_topic_score_gemma":0.0000032018452,"teacher_disagreement_score":0.8842474,"about_ca_system_score_codex":0.00010724088,"about_ca_system_score_gemma":0.00012969937,"threshold_uncertainty_score":0.9999507},"labels":[],"label_agreement":null},{"id":"W2144243803","doi":"10.4230/dagsemproc.10291.12","title":"On the Notion of Genre in Digital Preservation","year":2010,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Context (archaeology); Key (lock); Representation (politics); Open research; Digital preservation; Automation; World Wide Web; Data science; Information retrieval; Engineering; Computer security; History; Political science; Politics","score_opus":0.010652695654290995,"score_gpt":0.2503479191156682,"score_spread":0.23969522346137723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144243803","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6604256,0.00002647668,0.33278778,0.0010899166,0.00053438946,0.0010939545,0.00010785784,0.00028832306,0.0036456864],"genre_scores_gemma":[0.94641834,0.00000201098,0.05287773,0.00043883134,0.000036156573,0.000055228244,0.00006397519,0.0000121522,0.00009556873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985934,0.000011993801,0.00058506866,0.00015063421,0.0003718486,0.00028707465],"domain_scores_gemma":[0.9985178,0.00021297917,0.00032768273,0.0006689791,0.00022747525,0.00004506366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050006225,0.00017354489,0.00017854903,0.0001989026,0.000101367434,0.00033064757,0.001293364,0.00015158074,0.000008238355],"category_scores_gemma":[0.000453274,0.00011821276,0.00008869092,0.0003595195,0.00007307797,0.0028141425,0.00029284772,0.00048421847,0.000016932041],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010435289,0.00048102826,0.0053142994,0.00046888294,0.000041963827,0.0000035245848,0.011680615,0.00005842827,0.0030221478,0.89572936,0.002976524,0.08011884],"study_design_scores_gemma":[0.0046327678,0.0011571822,0.0069603743,0.0009486069,0.000027797321,0.000087354434,0.00093037396,0.4696809,0.11987445,0.3772653,0.016736712,0.0016981657],"about_ca_topic_score_codex":0.000011301362,"about_ca_topic_score_gemma":0.000020256703,"teacher_disagreement_score":0.5184641,"about_ca_system_score_codex":0.000037317877,"about_ca_system_score_gemma":0.000042102063,"threshold_uncertainty_score":0.48205766},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.025458243914129684,"score_gpt":0.28781296830220876,"score_spread":0.26235472438807905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145563891","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035194594,0.00007706859,0.95144266,0.0019486065,0.0073279915,0.0015343192,0.0001144581,0.00039700893,0.001963314],"genre_scores_gemma":[0.4514927,0.00012906159,0.54110867,0.0020335587,0.0019026948,0.0009124053,0.000749939,0.000111073394,0.0015599382],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963771,0.000092393755,0.0014329796,0.0005204094,0.00068779057,0.00088931713],"domain_scores_gemma":[0.9965404,0.00035750144,0.00085380394,0.001596406,0.00038245568,0.00026942062],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010094679,0.00058572757,0.00057671836,0.00022247083,0.0008518804,0.0024275866,0.0031921056,0.00068313885,0.0000098110495],"category_scores_gemma":[0.000097028955,0.00042681675,0.00052701344,0.0002432256,0.00014986216,0.0012278013,0.0026868952,0.0019037065,0.00013435994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051368005,0.000590877,0.0010069215,0.0012605833,0.00064543565,0.000010536738,0.015771467,0.0026920468,0.00029019834,0.4444676,0.02267693,0.5100737],"study_design_scores_gemma":[0.0030483631,0.00018259855,0.0017360485,0.00017273691,0.00007074143,0.00007770856,0.00018248246,0.7175778,0.0013743415,0.054964982,0.21962768,0.0009844997],"about_ca_topic_score_codex":0.00005545664,"about_ca_topic_score_gemma":0.00008063674,"teacher_disagreement_score":0.7148858,"about_ca_system_score_codex":0.00018220133,"about_ca_system_score_gemma":0.000304776,"threshold_uncertainty_score":0.9998184},"labels":[],"label_agreement":null},{"id":"W2152199276","doi":"10.4230/dagsemproc.05382.3","title":"Attention Demands in Text Entry Interfaces","year":2006,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Interactive and Immersive Displays","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Argument (complex analysis); Perception; Text entry; Cognition; Interface (matter); Human–computer interaction; Cognitive load; Word (group theory); Natural language processing; Cognitive psychology; Linguistics; Psychology","score_opus":0.006460817766876849,"score_gpt":0.23667861803876267,"score_spread":0.23021780027188582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152199276","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69079196,0.000077916506,0.27291027,0.0005562499,0.0014469825,0.0008558903,0.000113131784,0.00008722819,0.033160385],"genre_scores_gemma":[0.9945495,0.000016443842,0.0033651853,0.0006774719,0.000111166635,0.00007457706,0.00022929147,0.000021032183,0.00095533417],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976498,0.000039233822,0.00096036436,0.00030113469,0.00034967123,0.00069981045],"domain_scores_gemma":[0.9987152,0.00010162836,0.00035474225,0.00051822717,0.0002255602,0.000084632986],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034351271,0.0003323762,0.00034359752,0.0004033791,0.00018652399,0.0003927428,0.0009998619,0.0001635863,0.000040666015],"category_scores_gemma":[0.00003829261,0.0003050891,0.00021248312,0.0003728981,0.000071042276,0.0030140483,0.00036054075,0.00034387075,0.00035732277],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011575922,0.005743757,0.3788713,0.0024534834,0.00079511985,0.00012483382,0.037166905,0.001768235,0.037632238,0.32973173,0.16168767,0.042867135],"study_design_scores_gemma":[0.021636032,0.0018702111,0.3101354,0.001857196,0.00013154239,0.00037967027,0.009698114,0.33147347,0.10586893,0.01125186,0.20140952,0.004288034],"about_ca_topic_score_codex":0.00007895091,"about_ca_topic_score_gemma":0.00007052324,"teacher_disagreement_score":0.32970524,"about_ca_system_score_codex":0.0001761546,"about_ca_system_score_gemma":0.000043582804,"threshold_uncertainty_score":0.9999401},"labels":[],"label_agreement":null},{"id":"W2158382416","doi":"10.4230/lipics.swat.2016.30","title":"Time-Space Trade-offs for Triangulating a Simple Polygon","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":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada; Ministry of Education, Culture, Sports, Science and Technology; National Science Foundation","keywords":"Simple polygon; Workspace; Simple (philosophy); Polygon (computer graphics); Combinatorics; Binary logarithm; Space (punctuation); Computer science; SIMPLE algorithm; Algorithm; Mathematics; Time complexity; Monotone polygon; Discrete mathematics; Artificial intelligence; Geometry; Physics; Computer network","score_opus":0.015556284487119173,"score_gpt":0.2561525916758043,"score_spread":0.2405963071886851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158382416","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05237209,0.00003536757,0.94182247,0.002425447,0.000656458,0.0012862767,0.00033706572,0.00025317096,0.00081167236],"genre_scores_gemma":[0.8174745,0.000011874142,0.17704563,0.0016782745,0.00072263053,0.00033351555,0.00051231385,0.000059604085,0.0021616616],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976388,0.000039123228,0.0008942349,0.00033359442,0.0004226689,0.0006715811],"domain_scores_gemma":[0.9980222,0.00059123326,0.00041553515,0.00056027406,0.00020771695,0.0002030476],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00071317336,0.00032138868,0.0003625904,0.0002924496,0.0004252728,0.00032409126,0.000779191,0.00016290326,0.000031970456],"category_scores_gemma":[0.00026885318,0.0002463389,0.0002943394,0.00040853242,0.000060579758,0.0019121375,0.00020898807,0.000115756644,0.000114205846],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005654218,0.0007622695,0.0007939392,0.0007813868,0.00046150692,0.0000053164263,0.014048383,0.0034971978,0.0120418,0.14147367,0.07584801,0.7497211],"study_design_scores_gemma":[0.00898086,0.00072226836,0.0005977314,0.00016259923,0.000045901656,0.000060096518,0.00023251417,0.6519787,0.013949859,0.009175235,0.31315672,0.0009375693],"about_ca_topic_score_codex":0.000002949945,"about_ca_topic_score_gemma":0.000004271317,"teacher_disagreement_score":0.7651024,"about_ca_system_score_codex":0.00012770387,"about_ca_system_score_gemma":0.00012417258,"threshold_uncertainty_score":0.99999887},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Matroid; Power (physics); Matroid partitioning; Computer science; Mathematics; Combinatorics; Graphic matroid; Physics","score_opus":0.01917763530506628,"score_gpt":0.26032261563785397,"score_spread":0.2411449803327877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158685441","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.096423045,0.00023464469,0.8943897,0.00036770434,0.001710736,0.00075195706,0.00025151833,0.00014765473,0.0057230606],"genre_scores_gemma":[0.9827399,0.000054669556,0.016089987,0.0006939342,0.00011973497,0.00004386248,0.000039687424,0.000026960142,0.00019122977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968925,0.0000642487,0.0009437615,0.00019581916,0.00079792255,0.0011057232],"domain_scores_gemma":[0.9976275,0.00036736217,0.00032200877,0.0011847252,0.00022711421,0.00027130262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011969456,0.00032694088,0.0003685032,0.00018456145,0.0005419841,0.00036193046,0.0019110156,0.00014861855,0.000048585996],"category_scores_gemma":[0.000047388003,0.00023915646,0.00035674713,0.00045683002,0.0003936848,0.002033169,0.0009962582,0.00044777282,0.000112763446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035303432,0.0015576113,0.012318127,0.00084485195,0.0006649791,0.000009070648,0.0423865,0.0004385396,0.00012447358,0.74350035,0.021750607,0.17605188],"study_design_scores_gemma":[0.0080641415,0.0012821533,0.020118656,0.00035095375,0.00008291144,0.0003518624,0.006268849,0.21631853,0.006044049,0.03480598,0.7042157,0.0020962157],"about_ca_topic_score_codex":0.000021483034,"about_ca_topic_score_gemma":0.0000072724856,"teacher_disagreement_score":0.8863169,"about_ca_system_score_codex":0.00009088132,"about_ca_system_score_gemma":0.00007940408,"threshold_uncertainty_score":0.97525173},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.01021544677544756,"score_gpt":0.23883279442805475,"score_spread":0.2286173476526072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164928349","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.518744,0.0006764008,0.46781605,0.002008724,0.005403313,0.003263494,0.0011547393,0.00048367144,0.0004495967],"genre_scores_gemma":[0.88057786,0.00076533284,0.11456083,0.0011622738,0.00069277204,0.0005533889,0.0009874095,0.00017304074,0.0005270924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99504817,0.0001312633,0.002136161,0.00056459307,0.000940747,0.0011790443],"domain_scores_gemma":[0.99402076,0.000811943,0.0016478762,0.0024223595,0.0008219196,0.00027514694],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011444696,0.00078705885,0.0009733996,0.00025695245,0.00060260465,0.0012388111,0.004289738,0.0004329991,0.000017892244],"category_scores_gemma":[0.00017089483,0.0005320687,0.0006169918,0.00029232036,0.00039254775,0.00059942907,0.0039810548,0.0014388436,0.00007279557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050679396,0.0024572995,0.0041252943,0.012890012,0.003827256,0.000030028172,0.12757072,0.10515206,0.00035069685,0.44228035,0.093169406,0.20764007],"study_design_scores_gemma":[0.0011499783,0.0002648043,0.0002798108,0.00038084114,0.0000385214,0.000021243008,0.0006772132,0.9246588,0.00063332106,0.031707257,0.039511714,0.00067650265],"about_ca_topic_score_codex":0.00009465601,"about_ca_topic_score_gemma":0.000013075174,"teacher_disagreement_score":0.8195067,"about_ca_system_score_codex":0.00011384365,"about_ca_system_score_gemma":0.00029033615,"threshold_uncertainty_score":0.999798},"labels":[],"label_agreement":null},{"id":"W2169348983","doi":"10.4230/lipics.stacs.2014.149","title":"Palindrome Recognition In The Streaming Model","year":2014,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Substring; Palindrome; String (physics); Mathematics; Sublinear function; Combinatorics; Square root; Algorithm; Discrete mathematics; Computer science; Data structure","score_opus":0.02455233136888209,"score_gpt":0.25154909241749424,"score_spread":0.22699676104861213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169348983","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082044065,0.000013391426,0.91280675,0.00035568984,0.00035723782,0.00058070023,0.00017435772,0.000113834954,0.0035539933],"genre_scores_gemma":[0.878779,0.000022219854,0.11834676,0.0019530455,0.00013436846,0.00012888972,0.00055708067,0.000021503334,0.00005713933],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799573,0.00006473598,0.00071549974,0.00024560193,0.00045823958,0.0005201844],"domain_scores_gemma":[0.99844396,0.00019867296,0.00025804454,0.0008922475,0.000114945884,0.00009214397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010506542,0.00024886965,0.00025558274,0.00019149962,0.00028004934,0.00048006137,0.0015405177,0.00013906966,0.0000060763455],"category_scores_gemma":[0.000086664404,0.00017555249,0.00011685928,0.00029365582,0.000046822828,0.0021294313,0.00039585918,0.00034487218,0.0000925283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011133934,0.0011834842,0.0027001763,0.0006208324,0.0000958379,0.000014535079,0.04555436,0.008683174,0.00013455508,0.06172781,0.011591157,0.86758274],"study_design_scores_gemma":[0.0012036557,0.000112960704,0.0005391553,0.00011633106,0.000007761147,0.00003245866,0.00037421993,0.97857076,0.000106606494,0.009073228,0.0095885545,0.00027432258],"about_ca_topic_score_codex":0.00002115912,"about_ca_topic_score_gemma":0.000016736598,"teacher_disagreement_score":0.96988755,"about_ca_system_score_codex":0.00004939673,"about_ca_system_score_gemma":0.000037645743,"threshold_uncertainty_score":0.71588224},"labels":[],"label_agreement":null},{"id":"W2206671546","doi":"10.4230/lipics.cp.2022.8","title":"Learning MAX-SAT Models from Examples Using Genetic Algorithms and Knowledge Compilation","year":2015,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Modulo; Preference; Preference elicitation; Psychology; Mathematical economics; Computer science; Mathematics; Discrete mathematics; Statistics","score_opus":0.057327003122854825,"score_gpt":0.297874918731804,"score_spread":0.24054791560894917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2206671546","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17177935,0.0008383572,0.82255495,0.000083137085,0.0017227193,0.0009480387,0.00059511885,0.0004634051,0.001014956],"genre_scores_gemma":[0.3278224,0.00017810008,0.667651,0.00019057252,0.0008677536,0.000101645484,0.0027204412,0.0001330993,0.0003349823],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99586415,0.00022772784,0.0014766664,0.0008399323,0.0007032094,0.00088832836],"domain_scores_gemma":[0.9964688,0.00027661715,0.0010599082,0.0011723714,0.0005922378,0.00043005575],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010304847,0.00086559105,0.0010065882,0.00048484222,0.00059091323,0.001561282,0.0016471014,0.00064353255,0.000010932973],"category_scores_gemma":[0.000113652786,0.00084795704,0.0002781857,0.0002715358,0.00015603768,0.0013664443,0.0036161253,0.0018013906,0.000058118057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000082998726,0.00045537495,0.010670516,0.0020908306,0.0007236787,0.000022727672,0.09130614,0.62557995,0.000046815094,0.002447484,0.0013832866,0.2651902],"study_design_scores_gemma":[0.0015382542,0.00014742713,0.0008719502,0.0004820541,0.00008693633,0.000046624922,0.0005549169,0.9780729,0.000030154513,0.010000101,0.007238212,0.00093048066],"about_ca_topic_score_codex":0.00039093313,"about_ca_topic_score_gemma":0.000019993468,"teacher_disagreement_score":0.35249296,"about_ca_system_score_codex":0.0002719566,"about_ca_system_score_gemma":0.00036131818,"threshold_uncertainty_score":0.9994752},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.06318378054687857,"score_gpt":0.3127094173486242,"score_spread":0.2495256368017456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2224071963","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03205124,0.00081302616,0.9459915,0.0005212774,0.0026575902,0.0040891524,0.0032142533,0.0004625041,0.01019941],"genre_scores_gemma":[0.9113667,0.00014567023,0.08341916,0.0013268075,0.0003145268,0.0006812984,0.0025578926,0.000091722664,0.00009619303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99364316,0.00018610699,0.0022102143,0.00082346395,0.0015099067,0.0016271338],"domain_scores_gemma":[0.99444664,0.00032309073,0.0012387696,0.00314325,0.0005749766,0.0002732508],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0036248595,0.0010215557,0.0012175555,0.0007780462,0.0005872214,0.0024433339,0.0064633456,0.00091317703,0.00001580131],"category_scores_gemma":[0.0002176769,0.00080500316,0.0008091473,0.0007893808,0.0002310788,0.0033060967,0.0036837307,0.0025325133,0.0000491328],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001285893,0.001951065,0.0013552221,0.00464575,0.000723007,0.000065208864,0.0756811,0.19683437,0.000028498967,0.62696165,0.085035786,0.00543243],"study_design_scores_gemma":[0.0043772613,0.00013615904,0.00006513242,0.0004532152,0.000079137775,0.000029649635,0.0019040381,0.9056359,0.000045123088,0.062354725,0.023925805,0.0009938884],"about_ca_topic_score_codex":0.0001289927,"about_ca_topic_score_gemma":0.00014261862,"teacher_disagreement_score":0.8793155,"about_ca_system_score_codex":0.00023930891,"about_ca_system_score_gemma":0.0006022671,"threshold_uncertainty_score":0.9997687},"labels":[],"label_agreement":null},{"id":"W2234612416","doi":"10.4230/dagrep.4.8.1","title":"Querying and Reasoning Under Expressive Constraints (Dagstuhl Seminar 14331)","year":2014,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Uniwersytet Opolski; Universität Ulm; Goethe-Universität Frankfurt am Main; Clermont Université; Universidad de Chile; University of Waterloo; Technische Universität Wien; Technische Universität Darmstadt; Libera Università di Bolzano; Universität Bremen; Vienna Science and Technology Fund; University of Oxford; Technische Universität Dresden; Imperial College London; University of Washington; University of Pennsylvania","keywords":"Decidability; Computer science; Knowledge representation and reasoning; Representation (politics); Constraint (computer-aided design); Constraint satisfaction; Constraint satisfaction problem; Programming language; Artificial intelligence; Theoretical computer science; Political science; Mathematics","score_opus":0.011470493594912678,"score_gpt":0.24414770634958488,"score_spread":0.2326772127546722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2234612416","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24788192,0.00015237607,0.7391566,0.000624013,0.00095429376,0.0007307255,0.000052524098,0.0004593245,0.009988215],"genre_scores_gemma":[0.92003417,0.00004940512,0.077821314,0.0016119278,0.0001372945,0.00006584251,0.000046125362,0.000031822685,0.00020208453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971805,0.000075306656,0.0008981259,0.00044944062,0.00046960398,0.00092698634],"domain_scores_gemma":[0.9976019,0.0005239355,0.0004823056,0.00089090207,0.00023155274,0.00026936864],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008212374,0.00046599837,0.0005800909,0.00024281016,0.00053803413,0.0007412557,0.0011673032,0.00026603328,0.000015376441],"category_scores_gemma":[0.00036416823,0.0004084056,0.00017091258,0.00023127944,0.00039858915,0.0019216886,0.0007411724,0.00039179652,0.00006224721],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020461046,0.00055330823,0.03867836,0.0018832834,0.0007005864,0.000053412634,0.061262146,0.00061256305,0.0014637688,0.627769,0.014293831,0.25252512],"study_design_scores_gemma":[0.019343596,0.0018328507,0.025980595,0.003357015,0.0003039345,0.0020802554,0.032624677,0.7365279,0.017985638,0.037820775,0.11649305,0.0056496672],"about_ca_topic_score_codex":0.000024074974,"about_ca_topic_score_gemma":0.0000138278965,"teacher_disagreement_score":0.73591536,"about_ca_system_score_codex":0.00007712856,"about_ca_system_score_gemma":0.0000788417,"threshold_uncertainty_score":0.9998368},"labels":[],"label_agreement":null},{"id":"W2244339006","doi":"10.4230/dagsemproc.10431.2","title":"10431 Report – Software Engineering for Self-Adaptive Systems","year":2011,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Software engineering; Software system; Cover (algebra); Software; Adaptive system; Resource (disambiguation); Software development; Distributed computing; Engineering; Operating system; Artificial intelligence","score_opus":0.04869480189528133,"score_gpt":0.25725483047034836,"score_spread":0.20856002857506703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2244339006","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003035567,0.00011350168,0.98901695,0.000016710346,0.0032676302,0.0016923436,0.00015172856,0.0024231188,0.000282471],"genre_scores_gemma":[0.025583128,0.000014370821,0.9731116,0.000090934074,0.00017355439,0.00068610464,0.000082029146,0.00008340658,0.00017485397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966963,0.000033432716,0.001340801,0.00047060513,0.00042681143,0.0010320601],"domain_scores_gemma":[0.9964481,0.0008900933,0.0005937244,0.0013086695,0.00051637215,0.00024303829],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012660152,0.00055481686,0.0006927463,0.00033614633,0.0002792325,0.00023601323,0.0015628195,0.0002941993,0.0000027129681],"category_scores_gemma":[0.0014976708,0.00052952446,0.00031167062,0.00037013472,0.00005027527,0.0022067532,0.00050041283,0.00037820108,0.000029874334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00094655174,0.0023216628,0.010541208,0.01820194,0.0050440934,0.00074763264,0.17475653,0.2251638,0.00041537525,0.48020363,0.017794847,0.063862726],"study_design_scores_gemma":[0.0068100034,0.0020677065,0.0021442557,0.0010030549,0.00024228258,0.002345922,0.0024318446,0.8262849,0.007139624,0.008811325,0.13613373,0.004585374],"about_ca_topic_score_codex":0.0000112068865,"about_ca_topic_score_gemma":0.0000010966097,"teacher_disagreement_score":0.60112107,"about_ca_system_score_codex":0.00024273408,"about_ca_system_score_gemma":0.00010884998,"threshold_uncertainty_score":0.9997156},"labels":[],"label_agreement":null},{"id":"W2244997347","doi":"10.4230/lipics.csl.2012.9","title":"Connecting Complexity Classes, Weak Formal Theories, and Propositional Proof Systems (Invited Talk)","year":2012,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Proof complexity; Propositional variable; Computer science; Well-formed formula; Proof theory; Propositional calculus; Structural proof theory; Theoretical computer science; Calculus (dental); Mathematics; Programming language; Mathematical proof; Description logic; Intermediate logic; Medicine","score_opus":0.026254694933324902,"score_gpt":0.2601708381694452,"score_spread":0.23391614323612028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2244997347","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14384261,0.00033814125,0.84645516,0.0007194752,0.0024603524,0.0027381282,0.00045362447,0.000548831,0.0024436633],"genre_scores_gemma":[0.89996916,0.000008169112,0.09824147,0.0005933298,0.0005179707,0.00019999559,0.00037912402,0.000043421685,0.00004732919],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957172,0.00014666338,0.0014001889,0.0004392939,0.000798588,0.0014980433],"domain_scores_gemma":[0.99685705,0.00043868012,0.0006499356,0.00092377776,0.00064871274,0.0004818331],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0019353504,0.00057684595,0.00067194266,0.00027084083,0.0009544007,0.001047096,0.0012057413,0.00027359716,0.000016647009],"category_scores_gemma":[0.00022919744,0.00050213136,0.00020479996,0.0004844997,0.00030479283,0.0056821513,0.0014520463,0.00056201895,0.000029937077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018348482,0.0014622079,0.018130638,0.0026566014,0.00040878973,0.0000074889567,0.017027665,0.00065971445,0.0001071177,0.930012,0.0024799097,0.0268644],"study_design_scores_gemma":[0.0037801862,0.0006665267,0.0057016965,0.0002550941,0.00006617106,0.0013293918,0.0031635803,0.9086684,0.0005882371,0.011867839,0.06248927,0.0014236224],"about_ca_topic_score_codex":0.00006671815,"about_ca_topic_score_gemma":0.000026351876,"teacher_disagreement_score":0.91814417,"about_ca_system_score_codex":0.00029040617,"about_ca_system_score_gemma":0.00009638562,"threshold_uncertainty_score":0.9999899},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; 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","score_opus":0.01680353275891705,"score_gpt":0.24790817499607065,"score_spread":0.2311046422371536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2245114686","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27484766,0.0001120063,0.7159146,0.0011642687,0.00094689056,0.0039833784,0.00038405883,0.0005483934,0.0020987603],"genre_scores_gemma":[0.8253362,0.000026436708,0.17223813,0.0011306677,0.00017718588,0.00043873535,0.0004585829,0.000041589148,0.00015246685],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966898,0.000054266726,0.0012306303,0.00049932045,0.00048477747,0.0010412078],"domain_scores_gemma":[0.9978512,0.0002515508,0.0005005183,0.00093617314,0.00026198293,0.00019856433],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011643786,0.0004932466,0.0006221729,0.00065122277,0.0004948887,0.0007373314,0.0014880227,0.0002683275,0.000009937354],"category_scores_gemma":[0.00015146051,0.00049067463,0.00040000485,0.0008764027,0.000136114,0.003000846,0.00024283981,0.0003987584,0.00004277727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006052461,0.0047961776,0.008479201,0.0025226932,0.00050100125,0.000012426113,0.033152133,0.0011452037,0.0017020013,0.33382612,0.02173698,0.5915208],"study_design_scores_gemma":[0.008618014,0.0012607896,0.0041480702,0.0003502699,0.000042731783,0.00008470002,0.00033144967,0.79549164,0.0038213474,0.0930536,0.091118924,0.0016784844],"about_ca_topic_score_codex":0.000024074167,"about_ca_topic_score_gemma":0.000040492432,"teacher_disagreement_score":0.7943464,"about_ca_system_score_codex":0.00017628964,"about_ca_system_score_gemma":0.0001227843,"threshold_uncertainty_score":0.9997545},"labels":[],"label_agreement":null},{"id":"W2245981342","doi":"10.4230/lipics.csl.2013.296","title":"Theories for Subexponential-size Bounded-depth Frege Proofs","year":2013,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Mathematical proof; Bounded function; Proof complexity; Mathematics; Discrete mathematics; Class (philosophy); Complexity class; Pigeonhole principle; Proof theory; Computer science; Time complexity","score_opus":0.01360851346926505,"score_gpt":0.2445596853273095,"score_spread":0.23095117185804445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2245981342","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050580297,0.000112531496,0.9347641,0.0014344873,0.0027381426,0.0040451847,0.00041601708,0.00069063826,0.005218596],"genre_scores_gemma":[0.5866143,0.000047396825,0.40642542,0.0025042633,0.0005768128,0.0019001205,0.0003178471,0.00009552087,0.0015182976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99633765,0.000049345967,0.0012426851,0.00048482275,0.0006342915,0.0012511931],"domain_scores_gemma":[0.99662983,0.0005817727,0.0004951814,0.0013631079,0.00061676576,0.00031335073],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007297412,0.0005666415,0.0006001869,0.00026031438,0.00090339925,0.0017367656,0.002462734,0.00025695996,0.00009846002],"category_scores_gemma":[0.00024917893,0.00049832376,0.00053025293,0.00047806732,0.00033542328,0.0038576906,0.00079581235,0.00039147364,0.00025350958],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009719172,0.0006523243,0.0021887382,0.00089470734,0.00035594264,0.000003300118,0.011476646,0.000028922543,0.00014825266,0.8888376,0.02414098,0.07117545],"study_design_scores_gemma":[0.0064097894,0.0009606639,0.003531271,0.00024530917,0.00006286172,0.00011625772,0.0015269053,0.16010359,0.0036889552,0.5154134,0.3060643,0.0018767124],"about_ca_topic_score_codex":0.00005370679,"about_ca_topic_score_gemma":0.00004036835,"teacher_disagreement_score":0.53603405,"about_ca_system_score_codex":0.000105543346,"about_ca_system_score_gemma":0.00013307223,"threshold_uncertainty_score":0.99974686},"labels":[],"label_agreement":null},{"id":"W2248358623","doi":"10.4230/lipics.csl.2011.381","title":"A Formal Theory for the Complexity Class Associated with the Stable Marriage Problem","year":2011,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Complexity class; Bipartite graph; Mathematical proof; Lexicographical order; Mathematics; Class (philosophy); Discrete mathematics; Completeness (order theory); Matching (statistics); Computational complexity theory; Computer science; Combinatorics; Time complexity; Theoretical computer science; Graph; Algorithm; Artificial intelligence","score_opus":0.055634707499851235,"score_gpt":0.2694607798329779,"score_spread":0.21382607233312667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2248358623","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011367149,0.00005410275,0.97222793,0.0007825268,0.0002632881,0.0045595123,0.00054465025,0.0002986261,0.009902207],"genre_scores_gemma":[0.9263945,0.000018812498,0.06724868,0.002232999,0.000111490655,0.0019684674,0.00019749533,0.000103464015,0.0017240609],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962934,0.00020146942,0.0008014743,0.000357952,0.0007654167,0.0015802896],"domain_scores_gemma":[0.9954907,0.0015097087,0.0005991617,0.0015480634,0.000652467,0.00019994719],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0042499504,0.00046714256,0.0004434843,0.0001680292,0.0017593986,0.0005375602,0.0037076485,0.00016820671,0.000044786848],"category_scores_gemma":[0.00024186794,0.00024872003,0.00029994972,0.0006818133,0.0009661695,0.0029529578,0.0009710993,0.00068578427,0.000037158847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00078808,0.00030348147,0.0006081928,0.00018584185,0.00050084543,0.0000028300267,0.01648487,0.000116047355,0.00001566626,0.96966934,0.003037399,0.008287432],"study_design_scores_gemma":[0.01297305,0.0029036216,0.004386617,0.00034260482,0.00025192468,0.00012189865,0.011764155,0.28035846,0.0022465682,0.57646054,0.10622758,0.001962958],"about_ca_topic_score_codex":0.00001447689,"about_ca_topic_score_gemma":0.000104309926,"teacher_disagreement_score":0.9150274,"about_ca_system_score_codex":0.00015315489,"about_ca_system_score_gemma":0.0001671966,"threshold_uncertainty_score":0.9999965},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"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","score_opus":0.05522852973585569,"score_gpt":0.28918484811893547,"score_spread":0.2339563183830798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2249023948","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04138949,0.00004385553,0.95120126,0.0010821908,0.0005851557,0.0018441341,0.00057425455,0.00026108854,0.0030185778],"genre_scores_gemma":[0.62099636,0.000017446906,0.37722316,0.00070616655,0.000076956385,0.00028785196,0.00056472287,0.000027812921,0.00009950136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99740905,0.00009298962,0.0012213688,0.00027303142,0.0004118314,0.0005917033],"domain_scores_gemma":[0.9964936,0.0005454739,0.00061854644,0.0016312905,0.0005682071,0.0001429006],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013333203,0.00032749865,0.000559474,0.00021714278,0.00040083364,0.00026689647,0.0022769887,0.00015477068,0.000012162272],"category_scores_gemma":[0.000208954,0.00030745074,0.00034688995,0.00028035085,0.0005738918,0.001386637,0.0007354017,0.00025364835,0.000014076161],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000704914,0.00037808742,0.00060243066,0.0014080977,0.00012416898,1.0114157e-7,0.012269775,0.0001557542,0.000033589902,0.9656797,0.0025598176,0.016717983],"study_design_scores_gemma":[0.0031511527,0.0005704618,0.0009345625,0.00022944379,0.00004032194,0.000021563701,0.0010197066,0.5732377,0.0019627195,0.32138604,0.09678867,0.0006576151],"about_ca_topic_score_codex":0.000040050738,"about_ca_topic_score_gemma":0.00005605982,"teacher_disagreement_score":0.64429367,"about_ca_system_score_codex":0.00007122058,"about_ca_system_score_gemma":0.00006097837,"threshold_uncertainty_score":0.9999378},"labels":[],"label_agreement":null},{"id":"W2249508463","doi":"10.4230/oasics.cmn.2013.158","title":"Constructing Spatial Representations from Narratives and Non-Narrative Descriptions: Evidence from 7-year-olds","year":2013,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Spatial Cognition and Navigation","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Narrative; Construct (python library); Neighbourhood (mathematics); Narrative inquiry; Narrative network; Narrative criticism; Cognition; Comprehension; Psychology; Cognitive psychology; Narrative structure; Linguistics; Computer science; Mathematics","score_opus":0.018226694046280936,"score_gpt":0.25054892215536445,"score_spread":0.2323222281090835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2249508463","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.877256,0.0000808982,0.11815529,0.00019446947,0.0007103135,0.0010475948,0.0008174238,0.00022710388,0.0015109469],"genre_scores_gemma":[0.9735183,0.000071534945,0.024324603,0.00014064387,0.00023015328,0.0002993714,0.0013427724,0.00003821717,0.00003437366],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983419,0.000039568513,0.0007899722,0.00022119943,0.0002731859,0.00033415013],"domain_scores_gemma":[0.998673,0.0003354396,0.000206336,0.00029314967,0.00031965555,0.00017242119],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012352009,0.00030296072,0.00032172445,0.00014850557,0.00032499115,0.0004123722,0.00019224492,0.00018051204,0.00051977154],"category_scores_gemma":[0.00019126842,0.00030278836,0.000098089426,0.00018343212,0.00016386266,0.0024470715,0.00008121008,0.00032579276,0.00017272079],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003652762,0.00031055202,0.2846044,0.0008645281,0.001716449,0.0000079609545,0.55716664,0.001712924,0.027060622,0.0012992161,0.020426197,0.10446522],"study_design_scores_gemma":[0.008343199,0.00038211409,0.1103947,0.0023863849,0.00023799553,0.00002677361,0.3277685,0.5027601,0.031556387,0.0122147985,0.0017288362,0.002200176],"about_ca_topic_score_codex":0.0010879182,"about_ca_topic_score_gemma":0.00043022455,"teacher_disagreement_score":0.5010472,"about_ca_system_score_codex":0.000108643,"about_ca_system_score_gemma":0.000030300964,"threshold_uncertainty_score":0.9999424},"labels":[],"label_agreement":null},{"id":"W2250040917","doi":"10.4230/oasics.cmn.2013.147","title":"Testing Reader Ethical Judgments over the Course of a Narrative","year":2013,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Ethics in Business and Education","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Narrative; Reading (process); Psychology; Test (biology); Ethical issues; Social psychology; Computer science; Engineering ethics; Linguistics; Philosophy; Engineering","score_opus":0.16992978183789928,"score_gpt":0.4150164531278844,"score_spread":0.2450866712899851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2250040917","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9787724,0.000037180456,0.0048554195,0.007834765,0.0015510978,0.0012298815,0.00014144907,0.000046479505,0.0055313082],"genre_scores_gemma":[0.9915363,0.000009410365,0.0044019907,0.0031847064,0.0001747925,0.00016436195,0.000051101837,0.000023553139,0.00045374437],"study_design_codex":"qualitative","study_design_gemma":"observational","domain_scores_codex":[0.99582577,0.00013749597,0.0017278342,0.0002642811,0.001532498,0.00051209447],"domain_scores_gemma":[0.99084365,0.004389106,0.001059645,0.00096757495,0.0025910635,0.0001489747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040235403,0.00028238836,0.0004370998,0.00018601803,0.00059140177,0.0006108846,0.0012437429,0.000425805,0.00041988873],"category_scores_gemma":[0.006957921,0.00016188965,0.00019054097,0.000809968,0.00054846937,0.0012471887,0.00030948565,0.0009922843,0.00023531371],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016009729,0.0012211252,0.21340218,0.00061039254,0.00041812,0.0000014779362,0.4003227,0.00058500504,0.0009851526,0.031087756,0.28340265,0.067803316],"study_design_scores_gemma":[0.0044806786,0.00058504613,0.46429053,0.00091856794,0.00013707826,0.000069833215,0.22846559,0.074905485,0.002135144,0.15843539,0.06419253,0.0013841101],"about_ca_topic_score_codex":0.00015513282,"about_ca_topic_score_gemma":0.000041078532,"teacher_disagreement_score":0.25088835,"about_ca_system_score_codex":0.00006137248,"about_ca_system_score_gemma":0.00030425366,"threshold_uncertainty_score":0.8329784},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04170734998501201,"score_gpt":0.2783358575516958,"score_spread":0.2366285075666838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2252374344","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026472404,0.0007595079,0.95462596,0.0005740237,0.0126101645,0.0054745404,0.00070913386,0.0009291261,0.02167032],"genre_scores_gemma":[0.8593687,0.00010009982,0.12476118,0.002186619,0.002135508,0.0021209568,0.003375987,0.00022541865,0.005725562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99596834,0.00006571057,0.0015183163,0.00065179105,0.0006843397,0.0011114915],"domain_scores_gemma":[0.9953571,0.0001601077,0.0010721112,0.0018232155,0.0011855024,0.00040197736],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015151143,0.00075948355,0.0010475884,0.00031218154,0.00030549854,0.0013340451,0.002997849,0.00082967314,0.000013010915],"category_scores_gemma":[0.0002570007,0.00065375585,0.0005912696,0.00023031145,0.00014252475,0.0009882716,0.0019509776,0.00076323835,0.00032664428],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002993068,0.00021116744,0.0011690534,0.007804084,0.0014295066,0.000019168234,0.029305631,0.00033969965,0.000034109024,0.7077809,0.21590674,0.03570061],"study_design_scores_gemma":[0.002976232,0.0005556004,0.000036478443,0.00012600362,0.00012543019,0.000055048906,0.0004943834,0.08525013,0.00025697955,0.04793543,0.8608833,0.0013049871],"about_ca_topic_score_codex":0.000062922314,"about_ca_topic_score_gemma":0.000020215615,"teacher_disagreement_score":0.8567214,"about_ca_system_score_codex":0.0002742905,"about_ca_system_score_gemma":0.0005166292,"threshold_uncertainty_score":0.9997027},"labels":[],"label_agreement":null},{"id":"W2252725190","doi":"10.4230/lipics.socg.2015.733","title":"A Simpler Linear-Time Algorithm for Intersecting Two Convex Polyhedra in Three Dimensions","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":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polyhedron; Regular polygon; Convex polytope; Algorithm; Computer science; Combinatorics; Mathematics; Convex set; Convex optimization; Geometry","score_opus":0.03449451087858447,"score_gpt":0.29835211687478386,"score_spread":0.2638576059961994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2252725190","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08183502,0.000036709953,0.9146168,0.00038315353,0.0011017888,0.0011713095,0.00015684389,0.00016130517,0.000537053],"genre_scores_gemma":[0.47005826,0.000003341561,0.5266666,0.0016200667,0.00044419616,0.00025709605,0.0005886516,0.00004284522,0.00031895167],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99755365,0.00003834506,0.0009937609,0.00033261316,0.00043507438,0.0006465476],"domain_scores_gemma":[0.99802375,0.00034926768,0.00032609794,0.0004893565,0.00054398976,0.00026752838],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010327023,0.00031748012,0.00040579418,0.0004440035,0.0002384137,0.0002959363,0.0007183829,0.00013492488,0.000010553505],"category_scores_gemma":[0.00023100073,0.00030316738,0.00019234672,0.00059740164,0.00005330024,0.0016933712,0.0004253268,0.0002686604,0.00011397218],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055895397,0.0022056277,0.0064593772,0.0006674188,0.0007392627,0.000040008035,0.065716505,0.0570024,0.0010557424,0.07998439,0.022534968,0.76303536],"study_design_scores_gemma":[0.0040326267,0.00029520315,0.00013563034,0.000063584754,0.0000141801065,0.000048611357,0.00041476186,0.97478753,0.0006842995,0.005101785,0.01404736,0.0003743962],"about_ca_topic_score_codex":0.000032452343,"about_ca_topic_score_gemma":0.000058892387,"teacher_disagreement_score":0.91778517,"about_ca_system_score_codex":0.0001778033,"about_ca_system_score_gemma":0.00021481696,"threshold_uncertainty_score":0.99994206},"labels":[],"label_agreement":null},{"id":"W2264380204","doi":"10.4230/lipics.approx-random.2014.857","title":"It’s a Small World for Random Surfers","year":2014,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"PageRank; Logarithm; Upper and lower bounds; Random graph; Graph; Combinatorics; Computer science; Tree (set theory); Mathematics; Selection (genetic algorithm); Discrete mathematics; Theoretical computer science; Artificial intelligence","score_opus":0.01649037442209622,"score_gpt":0.26245746898906425,"score_spread":0.24596709456696803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2264380204","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025804872,0.000014770671,0.931354,0.0008973002,0.00047336024,0.0024674844,0.0005887078,0.00030334966,0.03809617],"genre_scores_gemma":[0.95639783,0.0000038733674,0.035697717,0.0018245162,0.0008588342,0.0008165507,0.0017646545,0.00009725182,0.002538781],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973125,0.00005009837,0.0012084765,0.0002979016,0.0002722392,0.00085879193],"domain_scores_gemma":[0.99769074,0.00050496944,0.00052632333,0.0007515641,0.00031018618,0.00021621282],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00094290246,0.00047292755,0.000771296,0.00032764007,0.00038497898,0.00031568852,0.00070342846,0.00009720902,0.00020755483],"category_scores_gemma":[0.00003882764,0.00043270036,0.0007807699,0.00034639012,0.00010072057,0.00042985508,0.0001997084,0.0003045798,0.00006771595],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019188061,0.0015466658,0.07169228,0.0012411898,0.0030586543,0.0000010175007,0.009371878,0.0013946926,0.00015585798,0.20328099,0.49734634,0.20899165],"study_design_scores_gemma":[0.0063472283,0.00017046585,0.00015147045,0.00012573815,0.00021153844,0.0000014331855,0.00046466006,0.09991626,0.00080634124,0.008922896,0.8822104,0.000671583],"about_ca_topic_score_codex":0.00005378466,"about_ca_topic_score_gemma":0.00014369935,"teacher_disagreement_score":0.93059295,"about_ca_system_score_codex":0.0000704037,"about_ca_system_score_gemma":0.000048869213,"threshold_uncertainty_score":0.9998125},"labels":[],"label_agreement":null},{"id":"W2266970999","doi":"10.4230/oasics.atmos.2015.95","title":"A Mixed Integer Linear Program for the Rapid Transit Network Design Problem with Static Modal Competition (Short Paper)","year":2015,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Comisión Nacional de Investigación Científica y Tecnológica; Instituto de Sistemas Complejos de Ingeniería","keywords":"Modal; Competition (biology); Integer (computer science); Integer programming; Computer science; Mathematical optimization; Linear programming; Flow network; Network planning and design; Algorithm; Mathematics; Telecommunications","score_opus":0.04996539748351885,"score_gpt":0.29056564212230135,"score_spread":0.2406002446387825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2266970999","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004824878,0.000046372268,0.98647314,0.001120402,0.00041193297,0.0052078683,0.00020729925,0.00031786313,0.0013902494],"genre_scores_gemma":[0.62856317,0.00007227346,0.36615872,0.0008375339,0.00041482717,0.0017545375,0.0019056257,0.00006747248,0.00022583986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977865,0.00010550705,0.00070463476,0.00018813883,0.0005718294,0.00064335053],"domain_scores_gemma":[0.99824995,0.00035420424,0.00024349784,0.00023051837,0.000698911,0.00022293365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016299767,0.00026454366,0.00030235233,0.00007781325,0.00082495064,0.00029390331,0.00035421483,0.00017092185,0.000024805133],"category_scores_gemma":[0.0000752485,0.00018590741,0.00013169057,0.0003726366,0.00026239583,0.00095935614,0.000011287233,0.00023619027,0.000011703915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020580871,0.0005876603,0.0022883746,0.00047227673,0.00045342997,0.0000030571593,0.1561409,0.76518923,0.0000027095534,0.021655299,0.011330802,0.0398182],"study_design_scores_gemma":[0.0058419,0.002010075,0.0005255433,0.0004032947,0.00038289427,0.000010003631,0.048837855,0.6235292,0.000043208125,0.0013217004,0.3162651,0.0008292039],"about_ca_topic_score_codex":0.00007609118,"about_ca_topic_score_gemma":0.00045986313,"teacher_disagreement_score":0.6237383,"about_ca_system_score_codex":0.00009812106,"about_ca_system_score_gemma":0.00031103427,"threshold_uncertainty_score":0.75810844},"labels":[],"label_agreement":null},{"id":"W2272363982","doi":"10.4230/lipics.tqc.2015.48","title":"The Spin-2 AKLT State on the Square Lattice is Universal for Measurement-based Quantum Computation","year":2015,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Quantum and electron transport phenomena","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Intelligence Advanced Research Projects Activity; National Science Foundation","keywords":"Cluster state; Quantum computer; Quantum entanglement; Computation; Statistical physics; Computer science; Quantum; Theoretical computer science; Quantum mechanics; Physics; Algorithm","score_opus":0.03657021278199733,"score_gpt":0.26169996048825983,"score_spread":0.22512974770626248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2272363982","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51292753,0.00009308209,0.46668798,0.0058075245,0.0011443957,0.004588294,0.0024226927,0.00018506653,0.0061434447],"genre_scores_gemma":[0.9976685,0.0000031501315,0.00036416942,0.0008989261,0.00013965109,0.00016293395,0.00058191596,0.000046253204,0.00013448838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99774593,0.000040139523,0.00068012904,0.00019819796,0.00061983237,0.0007157831],"domain_scores_gemma":[0.99815327,0.0002451943,0.00039625954,0.0004160972,0.0006112011,0.00017795326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001089213,0.00034639114,0.00027764752,0.000076327786,0.000748311,0.00028699424,0.00048703843,0.00006202986,0.000025204248],"category_scores_gemma":[0.000022239157,0.00022221879,0.00026550126,0.00017916979,0.00012284363,0.00038208815,0.000031263404,0.0003117638,0.000085307394],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0059207114,0.0023883507,0.017541958,0.0010764966,0.0026419167,0.000002814546,0.04909506,0.0151084475,0.00016999154,0.65395945,0.20068604,0.051408775],"study_design_scores_gemma":[0.013946297,0.002233893,0.0008840928,0.00023980388,0.00026211303,0.000001547741,0.019534545,0.42447957,0.0043461593,0.04470295,0.48808706,0.0012819651],"about_ca_topic_score_codex":0.000051163584,"about_ca_topic_score_gemma":0.000019857265,"teacher_disagreement_score":0.6092565,"about_ca_system_score_codex":0.00015918752,"about_ca_system_score_gemma":0.0002471771,"threshold_uncertainty_score":0.90618193},"labels":[],"label_agreement":null},{"id":"W2274270508","doi":"10.4230/lipics.approx-random.2014.596","title":"The Power of Super-logarithmic Number of Players","year":2014,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Random Matrices and Applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Department of Science and Technology, Ministry of Science and Technology, India; National Science Foundation","keywords":"Block (permutation group theory); Logarithm; Combinatorics; Randomness; Mathematics; Communication complexity; Discrete mathematics; Boolean function; Function (biology); Matrix (chemical analysis)","score_opus":0.015729154624178603,"score_gpt":0.2995939864223142,"score_spread":0.2838648317981356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2274270508","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92747027,0.000027060833,0.035789434,0.00032384341,0.00037693177,0.0015457587,0.00056245824,0.00006512362,0.033839144],"genre_scores_gemma":[0.98528993,0.00003720022,0.013708376,0.00009238941,0.000057946898,0.00011888973,0.000049662332,0.00003905816,0.00060653436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99770874,0.000035485646,0.0013018615,0.00012860206,0.00041100912,0.00041428255],"domain_scores_gemma":[0.9970315,0.0010594241,0.0007064382,0.0007862907,0.00032204663,0.00009430887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009199632,0.00024022673,0.0004808338,0.00008051598,0.00026058004,0.00006910174,0.0006640815,0.00015055052,0.00009130571],"category_scores_gemma":[0.00031966312,0.00016352115,0.00030728657,0.00022283892,0.00022781137,0.00028442507,0.00014044327,0.00020929314,0.00006974194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039234798,0.0007591925,0.009619068,0.0014928587,0.00050297834,3.7118696e-7,0.012108418,0.00004511333,0.00032192256,0.9435556,0.021974018,0.009228144],"study_design_scores_gemma":[0.019739602,0.0007483279,0.0026282007,0.0005605431,0.0005678216,0.00013086756,0.013302561,0.033102848,0.012600622,0.17032835,0.74466044,0.0016298101],"about_ca_topic_score_codex":0.000015139748,"about_ca_topic_score_gemma":0.000016630036,"teacher_disagreement_score":0.7732272,"about_ca_system_score_codex":0.00003172606,"about_ca_system_score_gemma":0.000040045124,"threshold_uncertainty_score":0.66681993},"labels":[],"label_agreement":null},{"id":"W2276905128","doi":"10.4230/lipics.approx-random.2015.265","title":"On Linear Programming Relaxations for Unsplittable Flow in Trees","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":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Alberta","funders":"","keywords":"Mathematics; Combinatorics; Linear programming relaxation; Path (computing); Omega; Tree (set theory); Rank (graph theory); Upper and lower bounds; Relaxation (psychology); Linear programming; Approximation algorithm; Binary logarithm; Constant (computer programming); Time complexity; Discrete mathematics; Algorithm; Computer science; Physics","score_opus":0.044742045626293775,"score_gpt":0.2913879659113839,"score_spread":0.2466459202850901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2276905128","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017815132,0.000037314945,0.9757641,0.00077963585,0.0011604987,0.0018898427,0.00024607443,0.00031362026,0.0019938066],"genre_scores_gemma":[0.18929607,0.000012256343,0.80753726,0.0010053776,0.00024329995,0.00078512117,0.00047754365,0.000050746967,0.0005923324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974708,0.00003208332,0.00093193527,0.00032313392,0.0004607889,0.0007812426],"domain_scores_gemma":[0.9980289,0.0003139435,0.00029928418,0.0007846016,0.00032494476,0.00024834],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008629644,0.0003205324,0.00038054062,0.0004306459,0.00031258364,0.00040343133,0.0011749639,0.00017005333,0.0000047589133],"category_scores_gemma":[0.0003477107,0.00029761496,0.0002299125,0.00068691483,0.00009112696,0.0015825296,0.00028869996,0.00033901763,0.000059823862],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004205142,0.0023945337,0.0039365576,0.0008051949,0.00022931014,0.000013853117,0.03993687,0.030911068,0.000012201138,0.59595627,0.020076888,0.30530673],"study_design_scores_gemma":[0.0034629668,0.000610637,0.00013814868,0.00015274387,0.000011904135,0.0000149089565,0.000629033,0.83222395,0.00017105576,0.020953482,0.14120641,0.00042474584],"about_ca_topic_score_codex":0.000026927382,"about_ca_topic_score_gemma":0.00011020476,"teacher_disagreement_score":0.80131286,"about_ca_system_score_codex":0.00016470713,"about_ca_system_score_gemma":0.00014715047,"threshold_uncertainty_score":0.9999476},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05926056696419222,"score_gpt":0.3147781806116966,"score_spread":0.25551761364750436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2277373197","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15728778,0.000069950285,0.83792114,0.00029636026,0.00096625136,0.0017988489,0.0008870865,0.0004900182,0.0002825765],"genre_scores_gemma":[0.9450559,0.0000120807035,0.052676078,0.0005560281,0.00032819188,0.00049442664,0.00061626796,0.00005822181,0.00020278843],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99647367,0.000046269568,0.00086294854,0.00043778503,0.0009073693,0.0012719854],"domain_scores_gemma":[0.99602264,0.0006451672,0.00029231285,0.001311634,0.0010653478,0.00066290976],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014952542,0.00048467057,0.0007218404,0.0010130715,0.00022444443,0.0006762522,0.0015744403,0.00016216918,0.000008916502],"category_scores_gemma":[0.0009772411,0.00042482722,0.0007408145,0.001165019,0.000092475646,0.0025388896,0.00059569074,0.00036086416,0.00013701337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022723484,0.0032012027,0.29489303,0.00369783,0.024690159,0.00028020205,0.17069186,0.02631659,0.00030588717,0.02712031,0.23955508,0.2069755],"study_design_scores_gemma":[0.0058256257,0.0011716391,0.013858555,0.00009841779,0.0003165564,0.00012681032,0.0007060014,0.9287963,0.0024352768,0.0009355625,0.04441703,0.0013122243],"about_ca_topic_score_codex":0.00010042719,"about_ca_topic_score_gemma":0.000014029293,"teacher_disagreement_score":0.9024797,"about_ca_system_score_codex":0.00047986044,"about_ca_system_score_gemma":0.00019014077,"threshold_uncertainty_score":0.99982035},"labels":[],"label_agreement":null},{"id":"W2278290577","doi":"10.4230/oasics.fsfma.2013.32","title":"On the Determinism of Multi-core Processors","year":2013,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Safran Electronics (Canada)","funders":"","keywords":"Core (optical fiber); Computer science; Multi-core processor; Determinism; Parallel computing; Philosophy; Telecommunications; Epistemology","score_opus":0.04619803570894649,"score_gpt":0.2935138285973516,"score_spread":0.2473157928884051,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2278290577","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052826,0.000052734835,0.9394551,0.00056666875,0.000988073,0.002593539,0.00020016528,0.00064232206,0.0026753875],"genre_scores_gemma":[0.67177707,0.000082745624,0.32482478,0.0017293274,0.000102383136,0.00066328933,0.00021541216,0.000069250214,0.0005357388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99675226,0.00006324934,0.0014963684,0.00044950168,0.00062585017,0.0006127639],"domain_scores_gemma":[0.9955493,0.00035728395,0.0014973808,0.0019049564,0.00054831593,0.00014274284],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00077873113,0.0006046427,0.00068217213,0.0003501432,0.000303396,0.00053788687,0.003623609,0.00050786603,0.000015498212],"category_scores_gemma":[0.00025020365,0.0004279552,0.0004023578,0.00026762515,0.00017853103,0.0005311295,0.0021884907,0.0009802592,0.000073037445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002700552,0.004354533,0.0027740998,0.013637567,0.0017409398,0.000019879866,0.11704762,0.12223759,0.00008784956,0.5318029,0.11420052,0.09182646],"study_design_scores_gemma":[0.00083068997,0.00022283522,0.00013769866,0.0007239008,0.000024750885,0.000012332696,0.00012103186,0.9785775,0.0018227879,0.013795852,0.0031182964,0.0006123238],"about_ca_topic_score_codex":0.000019721952,"about_ca_topic_score_gemma":0.0000024553633,"teacher_disagreement_score":0.85633993,"about_ca_system_score_codex":0.0000885708,"about_ca_system_score_gemma":0.0001966803,"threshold_uncertainty_score":0.99981725},"labels":[],"label_agreement":null},{"id":"W2280397671","doi":"10.4230/dagrep.4.5.40","title":"The Future of Refactoring (Dagstuhl Seminar 14211)","year":2014,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Software Engineering Techniques and Practices","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Universidade Federal de Pernambuco; Universiteit Antwerpen; University of Waterloo; Eidgenössische Technische Hochschule Zürich; Universitetet i Oslo; Oregon State University; Technische Universiteit Delft; University of Bern; Google; Université Catholique de Louvain; Universidade de Pernambuco; Universität Trier; Portland State University; Iowa State University","keywords":"Code refactoring; Pace; Computer science; Software engineering; Plan (archaeology); Breakout; Work (physics); Software; Programming language; Engineering; Business","score_opus":0.007149529876516246,"score_gpt":0.24185171350493004,"score_spread":0.2347021836284138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2280397671","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028215775,0.0003788598,0.9631891,0.001001576,0.0028402728,0.00072136737,0.000055005068,0.00078034116,0.002817649],"genre_scores_gemma":[0.78722954,0.0004928817,0.2103606,0.00051605277,0.00075609656,0.00013620107,0.0000518942,0.000066683904,0.00039002675],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977612,0.00005068542,0.0008633687,0.00022649067,0.0004981727,0.00060008524],"domain_scores_gemma":[0.99695206,0.00079248595,0.0005610914,0.001295379,0.0002557331,0.00014326259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013632947,0.0003232514,0.00035520957,0.00014183452,0.0004102763,0.00040637376,0.0020203784,0.00020163695,0.000005040425],"category_scores_gemma":[0.000246071,0.0002326827,0.0002153115,0.00034320107,0.00008028078,0.0015970275,0.00051127264,0.00045108865,0.00002512635],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018906404,0.0003624751,0.00916107,0.0016271814,0.00044730245,0.000006077191,0.017118845,0.00063116424,0.00040333398,0.39355335,0.03559378,0.54090637],"study_design_scores_gemma":[0.0006417205,0.00032576878,0.00076420227,0.00012818718,0.00002234654,0.000041042982,0.00035771733,0.041183006,0.003333991,0.0023454526,0.9504452,0.00041138747],"about_ca_topic_score_codex":0.000010618346,"about_ca_topic_score_gemma":0.0000060878097,"teacher_disagreement_score":0.9148514,"about_ca_system_score_codex":0.00006469119,"about_ca_system_score_gemma":0.000044769382,"threshold_uncertainty_score":0.9488525},"labels":[],"label_agreement":null},{"id":"W2281674668","doi":"10.4230/lipics.types.2014.72","title":"Typeful Normalization by Evaluation","year":2015,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Continuation; Normalization (sociology); Metaprogramming; Computer science; Modulo; Programming language; Type inference; Syntax; System F; Simply typed lambda calculus; Functional programming; Algebraic number; Algebra over a field; Inference; Typed lambda calculus; Lambda calculus; Mathematics; Discrete mathematics; Pure mathematics; Artificial intelligence","score_opus":0.03913021365096173,"score_gpt":0.28294360305770117,"score_spread":0.24381338940673944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2281674668","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009918193,0.00019947338,0.9679457,0.00022429384,0.00211762,0.0014191455,0.000034059998,0.0003284494,0.017813085],"genre_scores_gemma":[0.99067086,0.00001076492,0.0070399567,0.0005979617,0.00018265854,0.00017224016,0.0006937141,0.000025467845,0.0006063931],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975069,0.00007851314,0.00076666364,0.00025205343,0.0008743035,0.0005215258],"domain_scores_gemma":[0.997801,0.000043661028,0.00041094006,0.0006851983,0.0008110827,0.000248095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017158565,0.00026248282,0.000273676,0.00015778324,0.00019833825,0.0005508174,0.00090048,0.00019125611,0.000017500579],"category_scores_gemma":[0.00018166321,0.00022562662,0.00011404052,0.00038492223,0.000051230225,0.0021221675,0.00023547707,0.00016452614,0.00042661678],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013579753,0.0009157372,0.019036612,0.0007290785,0.00033497225,0.0000059143135,0.04434806,0.0011552562,0.00010107171,0.4838537,0.26704234,0.18234149],"study_design_scores_gemma":[0.0037619092,0.0004373251,0.00019136386,0.000018746992,0.00004531592,0.00005099608,0.00089056505,0.40650988,0.00077043474,0.01005531,0.5766681,0.000600096],"about_ca_topic_score_codex":0.000034323115,"about_ca_topic_score_gemma":0.000015143805,"teacher_disagreement_score":0.98075265,"about_ca_system_score_codex":0.00019934938,"about_ca_system_score_gemma":0.00017297674,"threshold_uncertainty_score":0.92007864},"labels":[],"label_agreement":null},{"id":"W2282111065","doi":"10.4230/dagrep.4.10.51","title":"Optimal algorithms and proofs (Dagstuhl Seminar 14421)","year":2015,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Council for Research in the Social Sciences, Columbia University; Universität Wien; Julius-Maximilians-Universität Würzburg; Université de Fribourg; Kungliga Tekniska Högskolan; University of Toronto; Universität Ulm; University of Leeds; Middlesex University; State University of New York; National Institute of Informatics; Univerzita Karlova v Praze; Technische Universität Chemnitz","keywords":"Mathematical proof; Computer science; Theoretical computer science; Algorithm; Mathematics","score_opus":0.027977739421020744,"score_gpt":0.28091864407180567,"score_spread":0.25294090465078495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2282111065","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032107867,0.0003087707,0.9484377,0.000791246,0.00068789546,0.001444215,0.00017123159,0.0015498715,0.014501224],"genre_scores_gemma":[0.1936907,0.00003318188,0.8032421,0.0012202114,0.00017379044,0.00025819984,0.00014182676,0.00007906558,0.001160903],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967392,0.000032630713,0.0010219311,0.00049621315,0.00076091813,0.00094909535],"domain_scores_gemma":[0.99725235,0.000096348595,0.0004462476,0.0010206685,0.00064071995,0.0005436423],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009908968,0.00054190296,0.00053637446,0.00034292348,0.0002679585,0.0019881586,0.0018428655,0.00025080482,0.0000031674367],"category_scores_gemma":[0.00025043904,0.0004910209,0.00015138178,0.00048703954,0.00027990554,0.0065771756,0.0014758683,0.00041771567,0.00009179355],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003275744,0.00197331,0.005836748,0.0025196706,0.00047867704,0.00014680914,0.058573805,0.00023265956,0.00030781026,0.040924527,0.13724591,0.7514325],"study_design_scores_gemma":[0.0066581587,0.0024304772,0.00037234987,0.0007946363,0.00009556692,0.0013411146,0.0023321228,0.59892833,0.01955982,0.019882083,0.34461907,0.0029862947],"about_ca_topic_score_codex":0.000010292764,"about_ca_topic_score_gemma":0.0000022398176,"teacher_disagreement_score":0.7484462,"about_ca_system_score_codex":0.00015999771,"about_ca_system_score_gemma":0.00021497576,"threshold_uncertainty_score":0.99975413},"labels":[],"label_agreement":null},{"id":"W2282291731","doi":"10.4230/lipics.tqc.2014.36","title":"Quantum Communication Complexity with Coherent States and Linear Optics","year":2014,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum information science; Communication complexity; Superposition principle; Computer science; Qubit; Quantum network; Unitary state; Quantum; Coherent states; Quantum error correction; Physics; Quantum information; Theoretical computer science; Quantum mechanics; Quantum entanglement","score_opus":0.018224700737952276,"score_gpt":0.25844339205781885,"score_spread":0.2402186913198666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2282291731","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6164764,0.000016059375,0.37898695,0.00044544192,0.000073010226,0.0008922498,0.0007085131,0.000075014774,0.0023263476],"genre_scores_gemma":[0.9836433,0.00002505284,0.014070847,0.00020725511,0.00008355772,0.00015782825,0.001728163,0.0000344814,0.000049530434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987016,0.000029169454,0.00054732483,0.0001622697,0.00019923672,0.00036040653],"domain_scores_gemma":[0.9985798,0.00011890794,0.00032783565,0.0006047315,0.00021363121,0.00015508049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003070263,0.0002566273,0.00030315307,0.00006110713,0.00043386346,0.0001798761,0.00033779035,0.000060700542,0.000042202995],"category_scores_gemma":[0.000006675039,0.00021078909,0.00007502388,0.0001128091,0.0001588327,0.0003183147,0.00016447068,0.00025974764,0.000040044833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039974704,0.00027045765,0.0048490064,0.00011993947,0.00011261932,5.2135853e-8,0.0015313657,0.000093626004,0.000026802769,0.98844534,0.0007355198,0.003775295],"study_design_scores_gemma":[0.0029093337,0.00032077823,0.0009631191,0.00013914771,0.000089036745,0.0000049309074,0.0028311857,0.77517223,0.00053290586,0.1468377,0.06963353,0.00056609366],"about_ca_topic_score_codex":0.00007272238,"about_ca_topic_score_gemma":0.00001972691,"teacher_disagreement_score":0.84160763,"about_ca_system_score_codex":0.000021347423,"about_ca_system_score_gemma":0.000027683593,"threshold_uncertainty_score":0.85957295},"labels":[],"label_agreement":null},{"id":"W2282607975","doi":"10.4230/lipics.fsttcs.2012.325","title":"k-delivery traveling salesman problem on tree networks","year":2012,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Travelling salesman problem; Pickup; Routing (electronic design automation); Vehicle routing problem; Tree (set theory); Traveling purchaser problem; Computer science; Mathematical optimization; Mathematics; Combinatorics; 2-opt; Artificial intelligence; Computer network","score_opus":0.017013542441611736,"score_gpt":0.2445203401976485,"score_spread":0.22750679775603677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2282607975","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18699975,0.00018932129,0.77497643,0.00006941987,0.0021994358,0.0014865224,0.00016796957,0.0013774529,0.032533705],"genre_scores_gemma":[0.8668713,0.000093016744,0.13113457,0.00044069692,0.00061045977,0.000116403964,0.0003699333,0.00016696645,0.00019665831],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971712,0.000051669213,0.0010912649,0.0001720241,0.00036613777,0.0011476948],"domain_scores_gemma":[0.99858975,0.00022125481,0.00020803182,0.0005294406,0.00013133508,0.00032020893],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009957608,0.0004825711,0.00045762086,0.00021768002,0.0002577033,0.00017428778,0.00042957344,0.00034622886,0.000046298013],"category_scores_gemma":[0.000060158927,0.00047626495,0.00022984148,0.00032868277,0.000058418536,0.0010617711,0.00009434028,0.00062029273,0.00015697387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010291652,0.00026695334,0.0115639,0.00083257706,0.00033063686,0.000001921975,0.008492725,0.90769356,0.00010222312,0.0032151556,0.006454423,0.060942985],"study_design_scores_gemma":[0.0018447309,0.00011160829,0.0015646536,0.00022275795,0.000065534645,0.000027098491,0.00053162995,0.9701001,0.000753536,0.00005825718,0.023993134,0.00072696235],"about_ca_topic_score_codex":0.0000028006382,"about_ca_topic_score_gemma":0.0000037162833,"teacher_disagreement_score":0.67987156,"about_ca_system_score_codex":0.00020189601,"about_ca_system_score_gemma":0.000020123942,"threshold_uncertainty_score":0.9997689},"labels":[],"label_agreement":null},{"id":"W2290038473","doi":"10.4230/lipics.rta.2015.241","title":"Constructing Orthogonal Designs in Powers of Two: Gröbner Bases Meet Equational Unification","year":2015,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Rewriting; Unification; Gröbner basis; Computation; Computer science; Coding theory; Algebra over a field; Theoretical computer science; Mathematics; Algorithm; Pure mathematics; Programming language","score_opus":0.05325202344418297,"score_gpt":0.28994845724449386,"score_spread":0.23669643380031088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2290038473","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31619042,0.000015920563,0.6796852,0.00033882674,0.0005748768,0.0004334546,0.00010232516,0.00007462065,0.002584372],"genre_scores_gemma":[0.9217374,0.000001458176,0.077645436,0.0002568795,0.00006559336,0.000030624833,0.00022107293,0.000011070101,0.000030501242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99780095,0.000067823865,0.0010339709,0.00021244149,0.00050323794,0.00038156152],"domain_scores_gemma":[0.99832076,0.00028750752,0.00052664254,0.0003377661,0.00036490007,0.00016245148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009477418,0.0002130209,0.0002938077,0.00034878324,0.00008989743,0.00014483153,0.00063361315,0.00008683031,0.000009653607],"category_scores_gemma":[0.00022479641,0.00020313237,0.000107046224,0.00048357263,0.000112392474,0.0016264635,0.00020433939,0.0001517631,0.000020213341],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012662387,0.0003433233,0.03442413,0.00018642853,0.000082341954,0.0000044300327,0.010385876,0.0069042286,0.0002945265,0.8898193,0.0012203129,0.05620843],"study_design_scores_gemma":[0.0065356484,0.00031954874,0.0035205197,0.00020399594,0.000023979786,0.00008099076,0.0025362605,0.9398116,0.0035553833,0.040685996,0.0020493094,0.000676809],"about_ca_topic_score_codex":0.000040222803,"about_ca_topic_score_gemma":0.000057660523,"teacher_disagreement_score":0.93290734,"about_ca_system_score_codex":0.00017192372,"about_ca_system_score_gemma":0.00033698586,"threshold_uncertainty_score":0.82834977},"labels":[],"label_agreement":null},{"id":"W2294324668","doi":"10.4230/darts.1.1.7","title":"The Love/Hate Relationship with the C Preprocessor: An Interview Study (Artifact)","year":2015,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Hate Speech and Cyberbullying Detection","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Deutsche Forschungsgemeinschaft; National Science Foundation","keywords":"Artifact (error); Grounded theory; Subject (documents); Preprocessor; Computer science; Process (computing); Psychology; Data science; Information retrieval; Epistemology; Social psychology; Artificial intelligence; World Wide Web; Sociology; Qualitative research; Social science; Philosophy","score_opus":0.047419963778204614,"score_gpt":0.2804762879035224,"score_spread":0.2330563241253178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294324668","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.687119,0.00013990697,0.29646215,0.003629615,0.0010857953,0.0035078574,0.000030393614,0.00049602095,0.007529287],"genre_scores_gemma":[0.9954248,0.000008358947,0.0026343234,0.000591321,0.000098454984,0.00015785084,0.000023639266,0.00002903721,0.0010321775],"study_design_codex":"qualitative","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974412,0.0002064333,0.0007191719,0.00031315137,0.0007104233,0.0006096649],"domain_scores_gemma":[0.9970882,0.00023356489,0.0004347465,0.0015189437,0.00047416228,0.00025041445],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0027017873,0.00032138673,0.00025303775,0.00010117788,0.0007757124,0.0014389649,0.0019272687,0.000098797595,0.0000049916202],"category_scores_gemma":[0.00016445162,0.00016957601,0.000102922495,0.00053123874,0.00013838931,0.0025380729,0.00037177134,0.0004764078,0.00037855154],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014663236,0.003698884,0.10296507,0.00077208737,0.0012846413,0.000043575958,0.533029,0.004169526,0.000035962883,0.03919536,0.029701365,0.28363818],"study_design_scores_gemma":[0.014761864,0.01155523,0.031971566,0.00048208848,0.00036892222,0.0006204693,0.12151125,0.279432,0.0020163737,0.010189965,0.524241,0.0028493023],"about_ca_topic_score_codex":0.000027938802,"about_ca_topic_score_gemma":0.00026894678,"teacher_disagreement_score":0.4945396,"about_ca_system_score_codex":0.000107417305,"about_ca_system_score_gemma":0.00014554586,"threshold_uncertainty_score":0.9995976},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.040418325749375754,"score_gpt":0.2913102703181808,"score_spread":0.25089194456880504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2296156273","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027351422,0.000111013665,0.93940383,0.0022627693,0.0015137735,0.0019179784,0.00013076828,0.0006489986,0.026659446],"genre_scores_gemma":[0.75894296,0.00012788735,0.23688123,0.0022786506,0.00017818503,0.0004584155,0.0006479335,0.00003770158,0.00044706604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99733156,0.00018921269,0.0011138149,0.00023456638,0.00057943154,0.00055142737],"domain_scores_gemma":[0.997073,0.00035938204,0.0004872499,0.0013126221,0.00048217876,0.00028554903],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002118696,0.00031088552,0.00060912856,0.00016654945,0.0003841954,0.0006161376,0.0017462778,0.00016699519,0.00002983162],"category_scores_gemma":[0.0002849656,0.00027903763,0.00034035338,0.00042758408,0.00028000574,0.0024702589,0.0006570391,0.0003595852,0.00038475692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0067391936,0.0008170494,0.0015328362,0.00034750407,0.00036349063,0.0000052201076,0.031184444,0.0003756154,0.0000055296214,0.8825613,0.04669962,0.029368175],"study_design_scores_gemma":[0.14217693,0.000191418,0.00013889352,0.0001997063,0.00006597503,0.000116940566,0.0009216155,0.55914044,0.00044057114,0.13613749,0.15957972,0.00089033425],"about_ca_topic_score_codex":0.0000429431,"about_ca_topic_score_gemma":0.00001681512,"teacher_disagreement_score":0.74642384,"about_ca_system_score_codex":0.000113212096,"about_ca_system_score_gemma":0.00010018075,"threshold_uncertainty_score":0.9999662},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.042338327910993775,"score_gpt":0.2922397059483311,"score_spread":0.2499013780373373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2296549964","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076582134,0.000058675294,0.92045957,0.00048064862,0.00076912,0.0008403888,0.00011763638,0.00014080807,0.00055105035],"genre_scores_gemma":[0.3077899,0.000010459097,0.6892532,0.0014284977,0.0003607586,0.00022620919,0.0003741936,0.000029044348,0.00052772823],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981561,0.000020375,0.00067257136,0.00029064235,0.00037480448,0.00048555364],"domain_scores_gemma":[0.99840325,0.00020903186,0.0002641533,0.00035379198,0.0004682312,0.00030153367],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00070364476,0.00026768184,0.00028878415,0.00021615523,0.00028569796,0.00056247786,0.0005863475,0.00012813229,0.0000027352717],"category_scores_gemma":[0.0002049535,0.00025466052,0.000121423436,0.00024280143,0.000065980705,0.0014520639,0.00028212523,0.00014104745,0.000028032213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069583365,0.0013134623,0.0039747264,0.0022578442,0.00063150167,0.000030918618,0.062150076,0.025555557,0.00032814543,0.20304216,0.050647717,0.64937204],"study_design_scores_gemma":[0.0026304624,0.00053021964,0.00023217779,0.00003886743,0.000023599097,0.00010787526,0.00028046416,0.9046012,0.0003886062,0.0031971969,0.087597646,0.0003716686],"about_ca_topic_score_codex":0.0000036559027,"about_ca_topic_score_gemma":0.000003132231,"teacher_disagreement_score":0.87904567,"about_ca_system_score_codex":0.000071441886,"about_ca_system_score_gemma":0.00014719368,"threshold_uncertainty_score":0.9999906},"labels":[],"label_agreement":null},{"id":"W2342776777","doi":"10.4230/lipics.isaac.2016.17","title":"On $r$-Guarding Thin Orthogonal Polygons","year":2016,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Polygon (computer graphics); Combinatorics; Polygon covering; Simple polygon; Point in polygon; Mathematics; Star-shaped polygon; Guard (computer science); Visibility polygon; Rectangle; Rectilinear polygon; Polygon mesh; Time complexity; Regular polygon; Discrete mathematics; Geometry; Computer science; Convex set","score_opus":0.019561566869496214,"score_gpt":0.27233527313246036,"score_spread":0.25277370626296414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2342776777","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041096274,0.000076151984,0.93819535,0.0015610711,0.005326547,0.0013287662,0.0010521514,0.000442861,0.010920824],"genre_scores_gemma":[0.9146788,0.000059357582,0.07604205,0.0037387346,0.0013126635,0.00040301468,0.001907253,0.00009304514,0.0017650957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99591434,0.00008578684,0.0014163955,0.00068276207,0.0010461848,0.00085451896],"domain_scores_gemma":[0.99647766,0.00047672514,0.0008533055,0.0013916198,0.00049411826,0.00030654305],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009581354,0.0007135323,0.00065848464,0.0007448412,0.0005257667,0.0009803752,0.0021020935,0.0005548556,0.000049482136],"category_scores_gemma":[0.00021916204,0.00059727253,0.0005891725,0.0003573105,0.00008628973,0.0012639336,0.0019481657,0.0009499824,0.00037793544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000220188,0.0006639111,0.00060218817,0.0012335778,0.0007161489,0.000021091057,0.007273569,0.029276742,0.00013008021,0.8353877,0.045043204,0.079431586],"study_design_scores_gemma":[0.005341121,0.00073390204,0.0013633635,0.0018633254,0.00012341174,0.00016014851,0.00020888644,0.66048974,0.0027578461,0.2141936,0.10974244,0.0030222218],"about_ca_topic_score_codex":0.000004343142,"about_ca_topic_score_gemma":0.0000054127668,"teacher_disagreement_score":0.87358254,"about_ca_system_score_codex":0.00028843043,"about_ca_system_score_gemma":0.00044037853,"threshold_uncertainty_score":0.99964786},"labels":[],"label_agreement":null},{"id":"W2395549257","doi":"10.4230/dagsemproc.10081.1","title":"10081 Abstracts Collection – Cognitive Robotics","year":2010,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Robotics and Automated Systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Informatics; Robotics; Computer science; Artificial intelligence; Cognitive robotics; Cognition; Section (typography); Research center; Cognitive science; Robot; Psychology; Engineering; Medicine; Electrical engineering; Neuroscience","score_opus":0.008313654482951193,"score_gpt":0.22287983400872424,"score_spread":0.21456617952577306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395549257","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85692835,0.000060301576,0.0702569,0.00014179348,0.0102956435,0.0025247077,0.0007743515,0.001819276,0.057198692],"genre_scores_gemma":[0.99267757,0.000026251293,0.0057667857,0.00012194308,0.00029982146,0.00008674611,0.00045444036,0.00009904983,0.0004673876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99771315,0.000011344469,0.001077487,0.00016752667,0.00034672825,0.0006837784],"domain_scores_gemma":[0.9987638,0.0001342578,0.00022621082,0.0003592922,0.0002863868,0.00023005683],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034776368,0.00040129706,0.00042137696,0.00025474798,0.000285626,0.00032751547,0.0003053746,0.000399846,0.000049099373],"category_scores_gemma":[0.00008900689,0.00039137487,0.00019067779,0.0002936978,0.000078027566,0.00066771754,0.00005947111,0.00070779753,0.00037647056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005027647,0.0020401003,0.019033784,0.010372605,0.0038772176,0.000098080265,0.039047863,0.7148946,0.02328372,0.0153840985,0.13606499,0.03540019],"study_design_scores_gemma":[0.0045556063,0.00024337704,0.0044175545,0.0003888193,0.00015029719,0.00022577788,0.0018621094,0.92551714,0.011081358,0.00031205264,0.049881116,0.001364791],"about_ca_topic_score_codex":0.000012220542,"about_ca_topic_score_gemma":0.000077521545,"teacher_disagreement_score":0.21062255,"about_ca_system_score_codex":0.0000816475,"about_ca_system_score_gemma":0.000046338824,"threshold_uncertainty_score":0.9998538},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.010145184393490743,"score_gpt":0.23287103519973626,"score_spread":0.22272585080624552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397354107","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.116663024,0.00006931783,0.86842257,0.0011820379,0.0013565955,0.001110156,0.0016048664,0.0005398065,0.009051614],"genre_scores_gemma":[0.9233751,0.00015073035,0.07412464,0.0014741954,0.00022789511,0.00015397015,0.00016899875,0.000042764885,0.0002816862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970231,0.000032702217,0.0009698511,0.00041762186,0.00055364356,0.0010030958],"domain_scores_gemma":[0.9971842,0.00027087424,0.00036543162,0.0015453863,0.00028239182,0.00035167474],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065247883,0.000436375,0.00046540072,0.00032827927,0.0004327678,0.0005213923,0.0021673033,0.0002287728,0.00005070573],"category_scores_gemma":[0.000106458945,0.00030558606,0.0003454992,0.00048246433,0.0001947117,0.0035200368,0.0008391965,0.00025351532,0.00046300222],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050847715,0.002375433,0.02426371,0.0015728495,0.0008920575,0.000058039328,0.02359949,0.00006889638,0.0030458733,0.5695245,0.22241282,0.15167782],"study_design_scores_gemma":[0.01013744,0.0008919029,0.0034128528,0.000681118,0.000079796184,0.00019647325,0.00081963703,0.029246496,0.009930702,0.021728413,0.9206794,0.0021957625],"about_ca_topic_score_codex":0.000020583462,"about_ca_topic_score_gemma":0.000021862961,"teacher_disagreement_score":0.8067121,"about_ca_system_score_codex":0.00007706209,"about_ca_system_score_gemma":0.00009868969,"threshold_uncertainty_score":0.9999396},"labels":[],"label_agreement":null},{"id":"W2397478800","doi":"10.4230/dagsemproc.09261.9","title":"Grammar-Based Integer Programing Models for Multi-Activity Shift Scheduling","year":2009,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Integer programming; Solver; Rule-based machine translation; Scheduling (production processes); Grammar; ENCODE; Theoretical computer science; Integer (computer science); Mathematical optimization; Algorithm; Programming language; Artificial intelligence; Mathematics","score_opus":0.20195313577961396,"score_gpt":0.4130827993715797,"score_spread":0.21112966359196575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397478800","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15907805,0.000059174192,0.835831,0.0010345236,0.00085896463,0.0018409984,0.00043533416,0.0003461086,0.0005158513],"genre_scores_gemma":[0.71848524,0.0000029215157,0.2799593,0.00076948514,0.00015256034,0.00020596705,0.00017341928,0.000039715425,0.00021142699],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945021,0.00009852086,0.0019436579,0.0006649941,0.0013531699,0.0014375022],"domain_scores_gemma":[0.9950434,0.0012200506,0.00093378534,0.0012444895,0.0011110029,0.00044729462],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0046173306,0.000597994,0.0008811416,0.0007885497,0.0011002581,0.0014680765,0.0014604861,0.0004092014,0.000027782668],"category_scores_gemma":[0.0030749822,0.0004889956,0.0008795797,0.0010321795,0.00021091782,0.0024162175,0.0001475845,0.00064964785,0.0001369336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002878674,0.0077477535,0.01222299,0.00079085404,0.0007975397,0.0000132719215,0.022484683,0.2936362,0.0005890147,0.07439606,0.004159884,0.5802831],"study_design_scores_gemma":[0.0039221346,0.00038555442,0.0008884577,0.0001305745,0.00007733374,0.000008195722,0.0008931029,0.967423,0.00078162464,0.014411982,0.010443842,0.00063417637],"about_ca_topic_score_codex":0.000032264412,"about_ca_topic_score_gemma":0.00003983734,"teacher_disagreement_score":0.6737868,"about_ca_system_score_codex":0.00017718364,"about_ca_system_score_gemma":0.0002914026,"threshold_uncertainty_score":0.99975616},"labels":[],"label_agreement":null},{"id":"W2397833257","doi":"10.4230/lipics.ccc.2016.5","title":"A Composition Theorem for Conical Juntas.","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":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Communication complexity; Upper and lower bounds; Context (archaeology); Mathematics; Tree (set theory); Combinatorics; Boolean function; Function (biology); Discrete mathematics; Decision tree model; Computer science; Decision tree; Artificial intelligence","score_opus":0.04365673072524578,"score_gpt":0.28863726379517657,"score_spread":0.24498053306993078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397833257","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015936997,0.00005332795,0.974492,0.001122285,0.0017491576,0.0014576265,0.00048481225,0.0003733931,0.004330397],"genre_scores_gemma":[0.61887944,0.00001508986,0.37582862,0.0033796793,0.00043806547,0.0003888056,0.0008086564,0.000051727366,0.00020995294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974666,0.000046701698,0.00091207045,0.00032003608,0.0005146339,0.0007399327],"domain_scores_gemma":[0.9976914,0.0002874643,0.00032159625,0.00084137707,0.0004953054,0.00036286912],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009850194,0.00034733623,0.00044386237,0.00021790047,0.00038140613,0.0005831237,0.001550479,0.00019488002,0.000009771909],"category_scores_gemma":[0.00010050732,0.0003136788,0.00034018297,0.0003362433,0.00020744494,0.0016382207,0.0005066791,0.00030455104,0.00009788673],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027197003,0.00060116895,0.0004907128,0.00033094746,0.00018046016,0.000005269871,0.008722396,0.00020320354,0.000045443325,0.9296737,0.028853053,0.0306217],"study_design_scores_gemma":[0.008560762,0.0010758087,0.00020571538,0.00016136165,0.000054368476,0.0001846624,0.0009262615,0.6087153,0.0015572009,0.10786338,0.26971343,0.0009817395],"about_ca_topic_score_codex":0.000008615223,"about_ca_topic_score_gemma":0.0000073009583,"teacher_disagreement_score":0.8218103,"about_ca_system_score_codex":0.00013506124,"about_ca_system_score_gemma":0.00014226291,"threshold_uncertainty_score":0.9999315},"labels":[],"label_agreement":null},{"id":"W2406981943","doi":"10.4230/dagsemproc.09171.1","title":"09171 Abstracts Collection – Adaptive, Output Sensitive, Online and Parameterized Algorithms","year":2009,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Parameterized complexity; Computer science; Informatics; Research center; Center (category theory); Work (physics); Algorithm; Theoretical computer science; Engineering; Electrical engineering","score_opus":0.03175318269460307,"score_gpt":0.28721453522514434,"score_spread":0.25546135253054125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406981943","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037202988,0.000036710404,0.9564362,0.0010435507,0.0006567393,0.0015601572,0.00035297283,0.00034130114,0.0023693363],"genre_scores_gemma":[0.23804481,0.00015748259,0.75839984,0.0015161443,0.0001579753,0.00005383523,0.00037494433,0.000038814804,0.0012561376],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99640834,0.00010959245,0.0012641139,0.00049765856,0.00085383235,0.00086646277],"domain_scores_gemma":[0.99722046,0.00032425235,0.0005062722,0.0007626164,0.00075474044,0.00043168358],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008935406,0.00046085418,0.00060216786,0.00056745776,0.00047198674,0.0007944836,0.0007788192,0.00025219517,0.000013561179],"category_scores_gemma":[0.00040607463,0.0004308099,0.00016957,0.0007908716,0.00014939246,0.001881675,0.0003193273,0.000528542,0.00006338693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013787451,0.0048512253,0.00083547086,0.0007442669,0.0010091986,0.00020498889,0.020880874,0.01016079,0.00055825425,0.018691719,0.020716216,0.91996825],"study_design_scores_gemma":[0.0035768861,0.00079687126,0.0053935223,0.00007526035,0.000027649583,0.00018075408,0.00034526474,0.97863525,0.0007418882,0.0007312308,0.008934634,0.00056079624],"about_ca_topic_score_codex":0.00002168777,"about_ca_topic_score_gemma":0.000006810679,"teacher_disagreement_score":0.96847445,"about_ca_system_score_codex":0.00015308084,"about_ca_system_score_gemma":0.00016040637,"threshold_uncertainty_score":0.9998144},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02679281900818871,"score_gpt":0.27077906729970047,"score_spread":0.24398624829151178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2412311009","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06457034,0.00018121889,0.90373254,0.011784548,0.0035022155,0.0016281185,0.0005684614,0.00076419377,0.013268372],"genre_scores_gemma":[0.88600147,0.0004606317,0.082893245,0.0078031,0.0008730493,0.00034950968,0.0000851496,0.00017626098,0.02135759],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99563694,0.00006001857,0.0014561833,0.00058163004,0.00090690743,0.0013583004],"domain_scores_gemma":[0.99647194,0.0003932581,0.00043041466,0.0018273181,0.00048333354,0.00039372663],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006983098,0.0006063064,0.0005733111,0.00033715222,0.00045735668,0.0008104723,0.002873564,0.00035472636,0.00034461872],"category_scores_gemma":[0.00022772058,0.00042863385,0.00046137997,0.00048215795,0.00032132055,0.004005616,0.0010567532,0.00037256876,0.0029350764],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027768657,0.0009629468,0.03805952,0.0006619191,0.0006281566,0.00003903599,0.06592705,0.00003565825,0.0016919362,0.16696313,0.21204968,0.5127033],"study_design_scores_gemma":[0.0014719372,0.0003595089,0.000981272,0.00045775308,0.000044578577,0.00010702573,0.0012050288,0.016656484,0.041764837,0.014094353,0.92143446,0.0014227612],"about_ca_topic_score_codex":0.000036115005,"about_ca_topic_score_gemma":0.00005810256,"teacher_disagreement_score":0.8214311,"about_ca_system_score_codex":0.00022673016,"about_ca_system_score_gemma":0.00017513403,"threshold_uncertainty_score":0.99981654},"labels":[],"label_agreement":null},{"id":"W2415039998","doi":"10.4230/lipics.swat.2016.3","title":"A Logarithmic Integrality Gap Bound for Directed Steiner Tree in Quasi-bipartite Graphs","year":2016,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Hausdorff Center for Mathematics; University of Waterloo","keywords":"Steiner tree problem; Bipartite graph; Combinatorics; Logarithm; Mathematics; Tree (set theory); Constant (computer programming); Discrete mathematics; Linear programming relaxation; Cover (algebra); Set (abstract data type); Upper and lower bounds; Computer science; Algorithm; Graph; Linear programming","score_opus":0.042358375616166954,"score_gpt":0.2944877939420583,"score_spread":0.25212941832589136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2415039998","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07304386,0.00029167108,0.9013825,0.0019035323,0.0063862903,0.0068927607,0.004692351,0.0013017246,0.0041053058],"genre_scores_gemma":[0.67293984,0.00039980316,0.3094428,0.0029877257,0.0011631498,0.006421428,0.0040222663,0.00036750754,0.0022555212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99335456,0.00017607863,0.0027043943,0.0011409229,0.0008726104,0.0017514074],"domain_scores_gemma":[0.9942912,0.00067368825,0.0012573249,0.0026416099,0.00073913054,0.00039708157],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018339003,0.0011937092,0.0015775635,0.0012732174,0.00045388975,0.0012935747,0.004216314,0.00091515464,0.000025328236],"category_scores_gemma":[0.00034788047,0.0010038594,0.0011973477,0.00078857277,0.00044975535,0.0017605254,0.0029237147,0.0014810613,0.000054428332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014499219,0.0054148207,0.015794002,0.011579108,0.0022840057,0.000068298665,0.03518668,0.00029884337,0.00017466668,0.5989259,0.0328142,0.29600957],"study_design_scores_gemma":[0.00999209,0.0008566579,0.0031127692,0.002733657,0.00013920927,0.00006639866,0.00043052604,0.4202644,0.00063307653,0.4844171,0.07426927,0.0030848607],"about_ca_topic_score_codex":0.00016533003,"about_ca_topic_score_gemma":0.00078915746,"teacher_disagreement_score":0.59989595,"about_ca_system_score_codex":0.0004903452,"about_ca_system_score_gemma":0.00039774936,"threshold_uncertainty_score":0.99974316},"labels":[],"label_agreement":null},{"id":"W2465741342","doi":"10.4230/dagsemproc.10071.6","title":"Every Deterministic Nonclairvoyant Scheduler has a Suboptimal Load Threshold","year":2010,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Sublinear function; Competitive analysis; Omega; Fixed point; Scheduling (production processes); Mathematics; Upper and lower bounds; Computer science; Discrete mathematics; BETA (programming language); Combinatorics; Algorithm; Mathematical optimization","score_opus":0.02426286062609075,"score_gpt":0.2645023520200533,"score_spread":0.24023949139396253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2465741342","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13121079,0.00003684613,0.8400231,0.0019780197,0.0035324541,0.0023600145,0.00026119497,0.00084972824,0.01974783],"genre_scores_gemma":[0.78936607,0.000020389305,0.20694031,0.0021486632,0.00022056141,0.00019700523,0.00014615523,0.00005950425,0.0009013744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961548,0.000032975095,0.0011945764,0.00046574348,0.0009868912,0.0011650241],"domain_scores_gemma":[0.9968508,0.0001619864,0.00039522725,0.0014162529,0.0006781316,0.00049761316],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010239034,0.00049817783,0.00049058866,0.0003170342,0.00069451885,0.0016164343,0.0021554541,0.0003477482,0.00015539181],"category_scores_gemma":[0.00021523343,0.00044198398,0.0003020033,0.00049263623,0.00032410765,0.0027911835,0.00082346174,0.0009875797,0.00060426566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012179761,0.0066508763,0.030874055,0.004505228,0.0015320914,0.00031271926,0.08574109,0.01448552,0.006981354,0.62386465,0.09153006,0.13230437],"study_design_scores_gemma":[0.0033144183,0.00037548726,0.00061566546,0.0000937712,0.000025789826,0.00017017928,0.00018304768,0.88788325,0.0011630857,0.0013695158,0.103945844,0.0008599542],"about_ca_topic_score_codex":0.000013771741,"about_ca_topic_score_gemma":0.000055658908,"teacher_disagreement_score":0.8733977,"about_ca_system_score_codex":0.00012259974,"about_ca_system_score_gemma":0.0005815603,"threshold_uncertainty_score":0.9998032},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.01391521125942484,"score_gpt":0.24175137597842083,"score_spread":0.22783616471899598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2465968014","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07160636,0.00014487928,0.9185911,0.0014821697,0.0033298305,0.0009900447,0.00036323673,0.0009019947,0.002590412],"genre_scores_gemma":[0.75399965,0.000069709014,0.24190252,0.0011655949,0.0006271158,0.00016941015,0.00023725453,0.000064386164,0.0017643982],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968635,0.00006380792,0.00096718746,0.0004697702,0.00067446474,0.00096127077],"domain_scores_gemma":[0.99765044,0.0004143759,0.00041953218,0.00096879667,0.00029405003,0.0002527985],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050729344,0.00046006203,0.00046907103,0.00027897637,0.00056145014,0.00057152694,0.0020791818,0.00020168193,0.000060770235],"category_scores_gemma":[0.00017794307,0.0003274273,0.00035056093,0.0004291332,0.00019493676,0.0028498461,0.0009048503,0.00055154413,0.00033674386],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008038716,0.0003084121,0.004300504,0.00014912429,0.00030406498,0.000018507746,0.009280618,0.00003390141,0.0004508252,0.036001008,0.0044962442,0.9445764],"study_design_scores_gemma":[0.010357228,0.0010375582,0.0055596484,0.00082551414,0.00006994302,0.00015485124,0.0011193878,0.44137776,0.009256361,0.044089895,0.4835239,0.002627968],"about_ca_topic_score_codex":0.000029898447,"about_ca_topic_score_gemma":0.000014761956,"teacher_disagreement_score":0.9419484,"about_ca_system_score_codex":0.00013101475,"about_ca_system_score_gemma":0.00008376033,"threshold_uncertainty_score":0.9999178},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"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","score_opus":0.03067713943686306,"score_gpt":0.24541119566093658,"score_spread":0.21473405622407352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2495677458","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051150043,0.00007986676,0.9174947,0.0025090373,0.0040249093,0.0095182955,0.00069765234,0.00057838374,0.013947128],"genre_scores_gemma":[0.93013877,0.00021088646,0.038402542,0.0054724617,0.0032872115,0.0070620878,0.009408044,0.00046455447,0.00555344],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969558,0.000008167827,0.0012346895,0.00054034434,0.0005138125,0.0007471795],"domain_scores_gemma":[0.99794346,0.000030460422,0.0006424154,0.00072127033,0.0006038228,0.000058548852],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008634276,0.0006742765,0.0006113399,0.00051085977,0.00047235782,0.0012334984,0.0005790545,0.00033482246,0.000059525893],"category_scores_gemma":[0.00008152918,0.0005292099,0.00023580756,0.00018816788,0.00015749501,0.002116022,0.0010068655,0.00033686892,0.00007979767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0061559337,0.0041984045,0.029558336,0.29518557,0.0076065576,0.000014235717,0.030595262,0.06124266,0.000103117214,0.11037663,0.12650128,0.328462],"study_design_scores_gemma":[0.004678369,0.0001237074,0.00041004908,0.0011787353,0.00030493707,0.0000036955203,0.0014978186,0.6711638,0.000012287406,0.00521269,0.31409585,0.0013180325],"about_ca_topic_score_codex":0.000110269524,"about_ca_topic_score_gemma":0.00023666752,"teacher_disagreement_score":0.87909216,"about_ca_system_score_codex":0.00015846713,"about_ca_system_score_gemma":0.000052004892,"threshold_uncertainty_score":0.9998033},"labels":[],"label_agreement":null},{"id":"W2506792106","doi":"10.4230/lipics.socg.2016.28","title":"Two Approaches to Building Time-Windowed Geometric Data Structures","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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ackermann function; Mathematics; Combinatorics; Intersection (aeronautics); Algorithm; Convex hull; Time complexity; Sequence (biology); Computational geometry; Binary logarithm; Data structure; Discrete mathematics; Computer science; Inverse; Regular polygon; Geometry","score_opus":0.10465413543093907,"score_gpt":0.28717925870178046,"score_spread":0.1825251232708414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2506792106","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.074722655,0.000043592387,0.920981,0.0008831079,0.00065835816,0.000841681,0.00036935823,0.00021256931,0.0012876994],"genre_scores_gemma":[0.6774864,0.0000070536526,0.32007346,0.0009903387,0.00038927986,0.00006269259,0.0004619161,0.000029263232,0.0004996043],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972425,0.000047192374,0.0008453709,0.0005337889,0.0006631923,0.0006679509],"domain_scores_gemma":[0.99728626,0.00036262342,0.0003044791,0.001553288,0.00019986824,0.00029346973],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00089397834,0.00034911692,0.00035456716,0.0008754652,0.00036764875,0.0005724386,0.0027126693,0.000116648225,0.00003934642],"category_scores_gemma":[0.00035522637,0.0002569153,0.000119924036,0.0013089305,0.000053618824,0.0030408755,0.0016025066,0.00015984698,0.00029718512],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016212427,0.00037232062,0.0026598757,0.00029542012,0.000395787,0.000007174871,0.003082167,0.008179816,0.0020373086,0.15309162,0.030274497,0.7994419],"study_design_scores_gemma":[0.009811664,0.0007610759,0.007737921,0.00028717975,0.00010248694,0.0002256638,0.00022948152,0.6127625,0.020585515,0.019969145,0.32503086,0.0024965191],"about_ca_topic_score_codex":0.0000050559433,"about_ca_topic_score_gemma":0.0000033336448,"teacher_disagreement_score":0.79694533,"about_ca_system_score_codex":0.00012001284,"about_ca_system_score_gemma":0.000117071846,"threshold_uncertainty_score":0.9999883},"labels":[],"label_agreement":null},{"id":"W2534741016","doi":"10.4230/lipics.ccc.2017.23","title":"Augmented Index and Quantum Streaming Algorithms for DYCK(2)","year":2016,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Industry Canada; Natural Sciences and Engineering Research Council of Canada; Government of Canada; Canadian Institute for Advanced Research","keywords":"Leverage (statistics); Upper and lower bounds; Quantum; Computer science; Generalization; Algorithm; Quantum algorithm; Theoretical computer science; Mathematics; Quantum mechanics; Physics; Artificial intelligence","score_opus":0.01704133513518973,"score_gpt":0.26744324661322655,"score_spread":0.2504019114780368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2534741016","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056802783,0.00020783885,0.93321764,0.0010996588,0.0033419444,0.002592694,0.0018466817,0.000577456,0.00031326848],"genre_scores_gemma":[0.620129,0.00020576693,0.3722619,0.0018106857,0.002014577,0.001124607,0.0014138155,0.00030695723,0.00073269196],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950205,0.00006717373,0.0017189124,0.0010147804,0.00072656065,0.0014520362],"domain_scores_gemma":[0.9956764,0.00054163404,0.0011849487,0.0016592817,0.0004984245,0.00043930003],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009564435,0.0010665717,0.0011260976,0.000595783,0.0006933997,0.0012756253,0.0024879312,0.0007501302,0.000005593605],"category_scores_gemma":[0.00015642992,0.00085435854,0.00055623654,0.0002484501,0.00021737942,0.00083370047,0.0037188353,0.0010916659,0.000017547569],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004282446,0.0010313286,0.0036490562,0.009588051,0.002104484,0.000042174786,0.024575593,0.0045751696,0.00013806418,0.056523904,0.014329732,0.8830142],"study_design_scores_gemma":[0.0034605756,0.00035775147,0.0004740143,0.0011390529,0.00005959905,0.00007974124,0.0002001662,0.9464044,0.00022345695,0.022452576,0.023972828,0.0011758355],"about_ca_topic_score_codex":0.000028303599,"about_ca_topic_score_gemma":0.000008036192,"teacher_disagreement_score":0.9418292,"about_ca_system_score_codex":0.00019222003,"about_ca_system_score_gemma":0.0002715511,"threshold_uncertainty_score":0.99976116},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010708093779433252,"score_gpt":0.23793670818291388,"score_spread":0.22722861440348063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2534763950","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86133975,0.000069368834,0.13363366,0.00055053004,0.00043995463,0.0011545452,0.00032769158,0.000049409675,0.0024350884],"genre_scores_gemma":[0.9926932,0.00009717469,0.0037817091,0.0003898802,0.00022294583,0.00031058126,0.0010530174,0.00003985614,0.0014116522],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99838006,0.00003322819,0.0005584129,0.0003155972,0.00029014106,0.00042257336],"domain_scores_gemma":[0.99855167,0.000019175432,0.00035612378,0.00060277,0.00031782858,0.0001524252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026203066,0.00026601896,0.00020280194,0.000128355,0.00020596823,0.000053557043,0.0002762219,0.0002425078,0.000029240327],"category_scores_gemma":[0.000035428726,0.00017860705,0.0001187195,0.00015578348,0.000099084966,0.00002671864,0.00009512117,0.0000966707,0.000059207494],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032321382,0.00065814954,0.008752855,0.00027599352,0.00028999304,0.0000028429447,0.0013667807,0.0007461385,0.84750974,0.0003303599,0.047731314,0.08910367],"study_design_scores_gemma":[0.012670795,0.0017151232,0.01189136,0.00037058463,0.000093438604,0.000057223606,0.0007952112,0.037495308,0.50502074,0.000057731067,0.42872185,0.0011106466],"about_ca_topic_score_codex":0.000003912483,"about_ca_topic_score_gemma":0.00001678293,"teacher_disagreement_score":0.38099054,"about_ca_system_score_codex":0.00012459417,"about_ca_system_score_gemma":0.00012510372,"threshold_uncertainty_score":0.7283384},"labels":[],"label_agreement":null},{"id":"W2536571921","doi":"10.4230/oasics.atmos.2016.6","title":"Multi-Column Generation Model for the Locomotive Assignment Problem","year":2016,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Railway Systems and Energy Efficiency","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Concordia University","keywords":"Column generation; Train; Decomposition; Column (typography); Computer science; Set (abstract data type); Decomposition method (queueing theory); Generator (circuit theory); Heuristics; Assignment problem; Process (computing); Fraction (chemistry); Mathematical optimization; Algorithm; Mathematics; Power (physics)","score_opus":0.029924688836358893,"score_gpt":0.23247067837628183,"score_spread":0.20254598953992292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2536571921","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022374252,0.00007381492,0.9729409,0.00019321108,0.00085692975,0.002016827,0.0004970365,0.00023038246,0.00081661396],"genre_scores_gemma":[0.97042197,0.000064456166,0.025559006,0.00016545031,0.00029836808,0.001431707,0.00012052931,0.00008560394,0.0018529224],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980375,0.000012851386,0.0008452033,0.00018206034,0.00029326312,0.0006291003],"domain_scores_gemma":[0.9989449,0.00012405551,0.00017044785,0.00045910254,0.00018250487,0.000119011034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048794234,0.00033440813,0.00029495836,0.00009712882,0.0003513214,0.00016649243,0.00041940509,0.0001752457,0.000013496488],"category_scores_gemma":[0.000035854184,0.00019871246,0.00021219633,0.00010741257,0.00006666343,0.0006366774,0.00006576589,0.00012571618,0.000048536313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052145402,0.00025184927,0.00040920367,0.00066618173,0.0004023864,6.248415e-7,0.00997136,0.9165153,0.005478085,0.0041744183,0.024277013,0.03780146],"study_design_scores_gemma":[0.0021181174,0.000087897075,0.000047071746,0.00009239162,0.00003259193,0.000005356805,0.00028779553,0.9643477,0.0019993861,0.00007269158,0.03058632,0.00032265406],"about_ca_topic_score_codex":0.000008833895,"about_ca_topic_score_gemma":0.000064630476,"teacher_disagreement_score":0.9480477,"about_ca_system_score_codex":0.00023732973,"about_ca_system_score_gemma":0.00003920093,"threshold_uncertainty_score":0.81032586},"labels":[],"label_agreement":null},{"id":"W2541904841","doi":"10.4230/lipics.ecoop.2016.8","title":"C++ const and Immutability: An Empirical Study of Writes-Through-const","year":2016,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Software Engineering Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Immutability; Computer science; Set (abstract data type); Benchmark (surveying); Code (set theory); Meaning (existential); State (computer science); Programming language; Epistemology; Philosophy; Blockchain; Computer security","score_opus":0.03031890135607083,"score_gpt":0.32196307523619433,"score_spread":0.2916441738801235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2541904841","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8641435,0.000029038152,0.13367836,0.00020063118,0.00030934502,0.0010467323,0.00012784684,0.00024231257,0.0002222192],"genre_scores_gemma":[0.9823266,0.000014491619,0.01724216,0.0002000868,0.00004871066,0.000090760725,0.000015515001,0.00002853744,0.00003311396],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9970448,0.0000890048,0.00105598,0.00041880776,0.00068056484,0.00071086426],"domain_scores_gemma":[0.99655277,0.0011906169,0.00022907407,0.0013760385,0.00038265894,0.0002688242],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001005037,0.00034007092,0.0005274578,0.00025679695,0.00018671884,0.00024923251,0.0012795936,0.00016081089,0.000021079913],"category_scores_gemma":[0.0006958732,0.00024719318,0.00010920222,0.00041993128,0.00034290174,0.0024370123,0.0008034988,0.00027887925,0.000035181856],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007405824,0.0011524716,0.9660157,0.00029150143,0.0001498841,0.000008252428,0.013494951,0.00002029992,0.00020502818,0.0011523743,0.0005279303,0.016907556],"study_design_scores_gemma":[0.035474654,0.011789133,0.8222565,0.00088881556,0.00015679513,0.00056973385,0.008322229,0.05431232,0.008417259,0.0032920984,0.05102083,0.0034996304],"about_ca_topic_score_codex":0.00004308642,"about_ca_topic_score_gemma":0.000021532762,"teacher_disagreement_score":0.14375919,"about_ca_system_score_codex":0.000106562096,"about_ca_system_score_gemma":0.00012436189,"threshold_uncertainty_score":0.99999803},"labels":[],"label_agreement":null},{"id":"W2558161679","doi":"10.4230/lipics.icdt.2015.342","title":"From Causes for Database Queries to Repairs and Model-Based Diagnosis and Back","year":2015,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Consistency (knowledge bases); Causality (physics); Database theory; Database; Information retrieval; Data mining; Database design; Artificial intelligence","score_opus":0.0445754772296752,"score_gpt":0.28253670423893745,"score_spread":0.23796122700926226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2558161679","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1993646,0.00030584264,0.7936211,0.0008687834,0.0006875169,0.0017402968,0.0017703194,0.00025927313,0.0013822288],"genre_scores_gemma":[0.5368933,0.000083805,0.4581834,0.0028175141,0.00025057248,0.0007264825,0.0006107314,0.000056805216,0.00037736475],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803877,0.000029101426,0.00062639115,0.00043179665,0.0002907923,0.00058315916],"domain_scores_gemma":[0.9977121,0.0003639876,0.0002151392,0.0008029714,0.00034780716,0.0005579898],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000529957,0.00036921402,0.000446413,0.00017485821,0.00025981967,0.00058266503,0.00067217805,0.00014424564,0.000006703558],"category_scores_gemma":[0.00044185924,0.00031567726,0.000108218715,0.0001901843,0.00013655346,0.0017661055,0.00061957224,0.00014234717,0.000050368464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001715256,0.0020671443,0.1233741,0.004317863,0.0008717059,0.000035350102,0.21633798,0.0035409827,0.00020639143,0.12285701,0.46613076,0.058545448],"study_design_scores_gemma":[0.004989444,0.0007441409,0.000363836,0.00026855498,0.00007340022,0.00001597927,0.0016166001,0.85108864,0.0022760388,0.005896046,0.1317375,0.0009298406],"about_ca_topic_score_codex":0.00008898076,"about_ca_topic_score_gemma":0.00012958587,"teacher_disagreement_score":0.84754765,"about_ca_system_score_codex":0.00007763688,"about_ca_system_score_gemma":0.0001596032,"threshold_uncertainty_score":0.99992955},"labels":[],"label_agreement":null},{"id":"W2561495450","doi":"10.4230/lipics.socg.2015.141","title":"1-String B_2-VPG Representation of Planar Graphs","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":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Planar; Planar graph; String (physics); Combinatorics; Representation (politics); Graph; Enhanced Data Rates for GSM Evolution; Mathematics; Grid; Computer science; Topology (electrical circuits); Geometry; Artificial intelligence; Computer graphics (images)","score_opus":0.04353341120342063,"score_gpt":0.28724107464332505,"score_spread":0.2437076634399044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2561495450","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19915068,0.000053228887,0.7962811,0.0002953907,0.0010082589,0.0005469227,0.00009088284,0.00013191791,0.0024416354],"genre_scores_gemma":[0.88807654,0.000015450798,0.110661775,0.00040638444,0.00012218206,0.000046239675,0.00045182966,0.000015524589,0.00020408002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979429,0.00004016804,0.0008629545,0.0002187806,0.00059424253,0.00034090024],"domain_scores_gemma":[0.9982102,0.00013087723,0.0004373259,0.000518225,0.00051212794,0.00019127582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055116107,0.000203015,0.00028822164,0.00039475402,0.00014047135,0.00019029477,0.0006823054,0.000108300585,0.0000050373465],"category_scores_gemma":[0.00015938898,0.00019700233,0.00015643709,0.0007548511,0.000051245497,0.0018026266,0.00017864039,0.00015286396,0.000041119376],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033951056,0.0008148044,0.019993145,0.00072752865,0.0004298875,0.000012951855,0.03286175,0.027670767,0.0009831664,0.774812,0.03970365,0.10165088],"study_design_scores_gemma":[0.011556359,0.0013806777,0.007373625,0.00029776787,0.00010296928,0.00023156707,0.00331607,0.75579476,0.03816139,0.09228188,0.08788257,0.0016203667],"about_ca_topic_score_codex":0.000020556094,"about_ca_topic_score_gemma":0.0000073035403,"teacher_disagreement_score":0.728124,"about_ca_system_score_codex":0.0000675624,"about_ca_system_score_gemma":0.00012428945,"threshold_uncertainty_score":0.8033522},"labels":[],"label_agreement":null},{"id":"W2563385979","doi":"10.4230/lipics.opodis.2015.3","title":"Time to Change: On Distributed Computing in Dynamic Networks (Keynote)","year":2016,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; CLARITY; Focus (optics); Field (mathematics); Order (exchange); Data science; Distributed computing; Network topology; Ubiquitous computing; Human–computer interaction; Computer network","score_opus":0.011793917093032246,"score_gpt":0.2500765987211474,"score_spread":0.23828268162811517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2563385979","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062849484,0.000034373126,0.93058467,0.0019387533,0.0009056824,0.0015817228,0.0009841952,0.0003192966,0.0008018476],"genre_scores_gemma":[0.9931113,0.00000998799,0.003970047,0.001925791,0.00017344291,0.00014349038,0.00033767265,0.000037618116,0.00029064793],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99670017,0.000059039463,0.0011771645,0.0004559635,0.00047855795,0.0011291124],"domain_scores_gemma":[0.99789274,0.00023185264,0.0003740975,0.0009858345,0.00020276493,0.00031268637],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00073331175,0.0004471569,0.00057525065,0.00029033277,0.00021696281,0.00033593678,0.0015300346,0.00023883788,0.000023160126],"category_scores_gemma":[0.00009980441,0.00033599915,0.00018348206,0.00076419214,0.00006689278,0.001236287,0.00051682635,0.00029305747,0.0009222329],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006728851,0.0017158422,0.008201058,0.00079439563,0.0003357171,0.00010802278,0.015761234,0.018020837,0.00028482714,0.018368756,0.054296132,0.8814403],"study_design_scores_gemma":[0.0034483061,0.00037471575,0.006972604,0.0011718734,0.000007734096,0.00003200717,0.000102891856,0.89926577,0.00006844432,0.00011865581,0.08764305,0.00079392345],"about_ca_topic_score_codex":0.000012468223,"about_ca_topic_score_gemma":0.000019539752,"teacher_disagreement_score":0.93026185,"about_ca_system_score_codex":0.0003533118,"about_ca_system_score_gemma":0.000041078107,"threshold_uncertainty_score":0.9999092},"labels":[],"label_agreement":null},{"id":"W2567588361","doi":"10.4230/lipics.socg.2017.45","title":"Lower Bounds for Differential Privacy from Gaussian Width","year":2017,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Differential privacy; Polytope; Gaussian; Workload; Convex geometry; Sample (material); Measure (data warehouse); Mathematics; Convex body; Sensitivity (control systems); Upper and lower bounds; Regular polygon; Computer science; Discrete mathematics; Algorithm; Convex optimization; Convex set; Mathematical analysis; Database; Geometry","score_opus":0.029747761094864964,"score_gpt":0.2898978853087917,"score_spread":0.2601501242139267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2567588361","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12389654,0.000030354435,0.8546963,0.009484339,0.0044662487,0.0017540556,0.0025733605,0.0010202718,0.0020785497],"genre_scores_gemma":[0.6288501,0.000035420293,0.36889973,0.0005373441,0.00034598084,0.00029329816,0.0007663251,0.00006563746,0.00020613904],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99607307,0.000027405144,0.0012061709,0.00070656236,0.0006811729,0.0013056375],"domain_scores_gemma":[0.98201185,0.00027864854,0.0010795713,0.016099269,0.00026614245,0.0002645358],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00050572294,0.0006260875,0.0006919186,0.00026550176,0.0016045086,0.0033349392,0.04478632,0.00048770165,0.000049409093],"category_scores_gemma":[0.00704444,0.0005609562,0.00041640224,0.00014681833,0.00041658888,0.0052653565,0.052771885,0.0005759173,0.00013783082],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006230642,0.0015804532,0.015237799,0.0011032129,0.0012480379,0.000038667935,0.0058977026,0.000009766937,0.0007700886,0.045777865,0.7112707,0.21644266],"study_design_scores_gemma":[0.009232499,0.0007288446,0.009857245,0.00045892826,0.000121163765,0.00003345341,0.00021739055,0.3661259,0.006000484,0.29684848,0.3084093,0.0019663149],"about_ca_topic_score_codex":0.00007797959,"about_ca_topic_score_gemma":0.00003772231,"teacher_disagreement_score":0.50495356,"about_ca_system_score_codex":0.00019731639,"about_ca_system_score_gemma":0.00013270944,"threshold_uncertainty_score":0.99969524},"labels":[],"label_agreement":null},{"id":"W2569250480","doi":"10.4230/lipics.stacs.2011.637","title":"Bounds on the maximum multiplicity of some common geometric graphs","year":2011,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft; National Science Foundation","keywords":"Combinatorics; General position; Mathematics; Omega; Upper and lower bounds; Spanning tree; Multiplicity (mathematics); Regular polygon; Discrete mathematics; Geometry; Physics","score_opus":0.03768576974394765,"score_gpt":0.2456183393488825,"score_spread":0.20793256960493484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2569250480","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.696433,0.000055669505,0.2956238,0.0003050222,0.0011073181,0.0010102588,0.00016024023,0.00014385434,0.0051607913],"genre_scores_gemma":[0.98478264,0.000020881105,0.013575757,0.0012909378,0.000064563275,0.000070531554,0.00009339008,0.000015498184,0.00008581751],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977914,0.000056557405,0.00088756287,0.00023042534,0.0005832327,0.00045080425],"domain_scores_gemma":[0.99793106,0.00035667297,0.00049159554,0.00082858355,0.00026681882,0.00012525046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008042128,0.00027869488,0.0003272084,0.0006448831,0.0003820338,0.00017514001,0.001349046,0.00013116487,0.00002803477],"category_scores_gemma":[0.00011794932,0.0002055245,0.00025593973,0.00118095,0.000120199744,0.0012418722,0.00034990278,0.00028813217,0.00008135087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024211635,0.0016315384,0.009684219,0.00041649674,0.00034615144,0.000004712167,0.014898476,0.0012201165,0.00023520585,0.87217665,0.006748535,0.09239577],"study_design_scores_gemma":[0.009097673,0.0038166917,0.07798162,0.00037529544,0.00014974618,0.00013127667,0.0017097398,0.50564927,0.08427462,0.2593086,0.054990448,0.0025150098],"about_ca_topic_score_codex":0.000033863627,"about_ca_topic_score_gemma":0.000008575521,"teacher_disagreement_score":0.6128681,"about_ca_system_score_codex":0.000058004316,"about_ca_system_score_gemma":0.000060962928,"threshold_uncertainty_score":0.8381046},"labels":[],"label_agreement":null},{"id":"W2569474846","doi":"10.4230/dagrep.6.4.80","title":"Natural Language Argumentation: Mining, Processing, and Reasoning over Textual Arguments (Dagstuhl Seminar 16161)","year":2016,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Software Engineering Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Argumentation theory; Argument (complex analysis); Natural (archaeology); Computer science; Cognition; Task (project management); Epistemology; Computational linguistics; Natural language; Linguistics; Natural language processing; Cognitive science; Psychology; Philosophy; Management; History","score_opus":0.008148196413969548,"score_gpt":0.2725896490723868,"score_spread":0.2644414526584173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2569474846","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8739117,0.0005010686,0.12229194,0.0003406593,0.0006897085,0.00090817246,0.00012357363,0.0005968476,0.00063637935],"genre_scores_gemma":[0.9537485,0.000034943427,0.043910302,0.0003643205,0.00017577967,0.00013344407,0.00007532015,0.000054353866,0.001502989],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968393,0.000037696907,0.0007688348,0.000477846,0.0008758656,0.0010004776],"domain_scores_gemma":[0.9979491,0.0004633935,0.00032479817,0.00072820496,0.00023056439,0.00030391917],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00067052763,0.00045280924,0.00038844807,0.00036332753,0.0003528554,0.00072015205,0.0011474062,0.00018065394,0.000036347126],"category_scores_gemma":[0.00055731734,0.00034448912,0.00012396733,0.00041457204,0.00015742637,0.0030247965,0.00071813766,0.00032649364,0.00007573846],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002935416,0.0006251792,0.26410592,0.0022115353,0.000607461,0.00012934896,0.086941384,0.000050686016,0.003744663,0.006025221,0.030567186,0.6046979],"study_design_scores_gemma":[0.04956915,0.0035615058,0.2728765,0.009430879,0.0003124428,0.0021162252,0.01908386,0.4097398,0.038888585,0.0008694681,0.18401988,0.009531712],"about_ca_topic_score_codex":0.000011741036,"about_ca_topic_score_gemma":0.0000065965355,"teacher_disagreement_score":0.59516615,"about_ca_system_score_codex":0.00023766438,"about_ca_system_score_gemma":0.0001094129,"threshold_uncertainty_score":0.9999007},"labels":[],"label_agreement":null},{"id":"W2570673800","doi":"10.4230/lipics.opodis.2015.2","title":"Dynamic Reconfiguration: A Tutorial (Tutorial)","year":2016,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Air Force Office of Scientific Research; Azrieli Foundation; National Science Foundation","keywords":"Control reconfiguration; Computer science; Distributed computing; Reliability (semiconductor); Server; Key (lock); Object (grammar); Embedded system; Reliability engineering; Computer network; Engineering; Power (physics); Operating system; Artificial intelligence","score_opus":0.008623260246433827,"score_gpt":0.2393983755626764,"score_spread":0.23077511531624256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2570673800","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01683943,0.00005564568,0.95334005,0.0018245704,0.017102065,0.0013674855,0.0010711454,0.0005636676,0.007835952],"genre_scores_gemma":[0.96947473,0.00005645414,0.02380077,0.00072207244,0.001668042,0.00038355897,0.0003268654,0.00006166602,0.0035058116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967806,0.000051021918,0.0013396398,0.00040901097,0.00061288546,0.0008068818],"domain_scores_gemma":[0.9973784,0.00018140754,0.0005621686,0.0011642119,0.0004551055,0.00025867994],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00068638305,0.00041434047,0.000506069,0.00016276746,0.00035459248,0.0006842188,0.0015101429,0.00029050282,0.00004464397],"category_scores_gemma":[0.00016308698,0.00029501642,0.00028358283,0.0003529423,0.00009357893,0.0030666476,0.00024174317,0.00021110047,0.0005494402],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000594797,0.000967505,0.0018428004,0.0010555234,0.00071224384,0.000045857018,0.014432016,0.000116828676,0.0035546662,0.45406145,0.13773382,0.38488248],"study_design_scores_gemma":[0.0056724763,0.00031563517,0.00034012776,0.0003137239,0.000020759053,0.0000922498,0.00016111355,0.031421028,0.00079126586,0.002429976,0.95764023,0.0008014305],"about_ca_topic_score_codex":0.000013498299,"about_ca_topic_score_gemma":0.000019521036,"teacher_disagreement_score":0.95263535,"about_ca_system_score_codex":0.0002738173,"about_ca_system_score_gemma":0.00017514998,"threshold_uncertainty_score":0.9999502},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.015584024005765048,"score_gpt":0.24810136650653028,"score_spread":0.23251734250076522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2571737124","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7516265,0.000075946205,0.24136813,0.0015980159,0.0008461737,0.0013432127,0.00015490084,0.00023377902,0.0027533534],"genre_scores_gemma":[0.98632276,0.000043405027,0.011903629,0.0009509464,0.00006837254,0.0001324342,0.00021125392,0.000025015683,0.00034220528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970363,0.00008644893,0.0012471122,0.00037454735,0.0005229997,0.00073262875],"domain_scores_gemma":[0.9983069,0.00037031362,0.00028591836,0.00064476294,0.00019926084,0.0001928617],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009165292,0.00036377914,0.00041159516,0.0008826211,0.00013060789,0.0002676288,0.0010252796,0.00018336071,0.00004270657],"category_scores_gemma":[0.00012740507,0.0002855238,0.0001612894,0.0010766252,0.00007369925,0.002476874,0.00029405818,0.00023852814,0.00030193536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005601986,0.00430571,0.24461502,0.001060493,0.0005200303,0.00020695345,0.04342811,0.011406847,0.005763405,0.33978936,0.017888643,0.3304552],"study_design_scores_gemma":[0.013658992,0.0010226859,0.073013596,0.0009623014,0.000048264763,0.00015703298,0.00061422924,0.8039148,0.004936729,0.040141933,0.059029423,0.0025000474],"about_ca_topic_score_codex":0.000019259518,"about_ca_topic_score_gemma":0.00013546532,"teacher_disagreement_score":0.7925079,"about_ca_system_score_codex":0.00016534422,"about_ca_system_score_gemma":0.00015358452,"threshold_uncertainty_score":0.9999597},"labels":[],"label_agreement":null},{"id":"W2576120132","doi":"10.4230/lipics.isaac.2016.57","title":"Scaling and Proximity Properties of Integrally Convex Functions","year":2016,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Japan Society for the Promotion of Science; Core Research for Evolutional Science and Technology; Hausdorff Center for Mathematics; Mitsubishi Foundation","keywords":"Integrally closed; Mathematics; Convex analysis; Scaling; Subderivative; Proper convex function; Convex combination; Convex function; Logarithm; Regular polygon; Dimension (graph theory); Convex optimization; Convex set; Combinatorics; Pure mathematics; Discrete mathematics; Mathematical analysis; Geometry","score_opus":0.01748297982224099,"score_gpt":0.20273563698842234,"score_spread":0.18525265716618136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2576120132","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8886799,0.00015953346,0.106822275,0.0000976491,0.00036467414,0.00065245834,0.00014591186,0.0005894703,0.0024880825],"genre_scores_gemma":[0.99560237,0.00014963845,0.003935564,0.000069057394,0.000050002993,0.0000487541,0.000015337404,0.0000344734,0.00009480421],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988588,0.000011192777,0.0005586381,0.00010662277,0.00015985637,0.00030489164],"domain_scores_gemma":[0.99926156,0.000053148877,0.000112720336,0.0003019953,0.00019069934,0.000079889294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015742543,0.00022188471,0.00030503722,0.00021440552,0.000093093506,0.000058378708,0.00017969288,0.00012903244,0.000010673284],"category_scores_gemma":[0.000070400834,0.00014687164,0.0000955657,0.0001236963,0.00016128825,0.0006412958,0.00009235556,0.0001445578,0.0000127471985],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011434064,0.00091349817,0.037475344,0.008106445,0.0026187107,0.000012759509,0.028107341,0.0011624577,0.4000011,0.016236097,0.062014204,0.44220862],"study_design_scores_gemma":[0.0048995796,0.0005423847,0.0020643407,0.0044047404,0.00020822247,0.00013924125,0.0030059638,0.10258188,0.7917235,0.0025381565,0.08625948,0.0016325214],"about_ca_topic_score_codex":0.000009096745,"about_ca_topic_score_gemma":0.000006547863,"teacher_disagreement_score":0.4405761,"about_ca_system_score_codex":0.000034416178,"about_ca_system_score_gemma":0.000015801821,"threshold_uncertainty_score":0.5989251},"labels":[],"label_agreement":null},{"id":"W2577191082","doi":"10.4230/lipics.isaac.2016.56","title":"Approximation Algorithms for Capacitated k-Travelling Repairmen Problems","year":2016,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates","keywords":"Rounding; Vehicle routing problem; Computer science; Approximation algorithm; Latency (audio); Mathematical optimization; Algorithm; Travelling salesman problem; Constant (computer programming); Routing (electronic design automation); Mathematics; Computer network; Telecommunications","score_opus":0.027757152322522058,"score_gpt":0.25974010107693307,"score_spread":0.231982948754411,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577191082","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027785035,0.00002789088,0.96602756,0.00012800425,0.00079056266,0.0021612013,0.0005998051,0.0010405668,0.0014394005],"genre_scores_gemma":[0.17896453,0.00008429525,0.8180455,0.00016692255,0.00031268853,0.0008792476,0.00067722134,0.00023099444,0.0006385801],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973064,0.000035664358,0.0012874086,0.00024686925,0.00032226904,0.00080137583],"domain_scores_gemma":[0.9983164,0.00032469773,0.00029760352,0.0004955901,0.00038657108,0.00017912714],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011867231,0.0004126688,0.00043684916,0.00027437767,0.00024492817,0.00016707831,0.00037023012,0.0002923815,0.000027685464],"category_scores_gemma":[0.00024672603,0.00033250402,0.00022463396,0.00029041088,0.000076239885,0.001101359,0.000052419764,0.00019894494,0.000055665547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004744942,0.0007333377,0.0048441794,0.013765063,0.0020403443,0.0000047684125,0.052419912,0.48749793,0.018894598,0.011754194,0.019560777,0.3880104],"study_design_scores_gemma":[0.0033782239,0.00015037786,0.000080384954,0.00033445875,0.000051692714,0.000019903597,0.00042350197,0.96442455,0.008803693,0.0010212803,0.02069923,0.0006127246],"about_ca_topic_score_codex":0.000002830647,"about_ca_topic_score_gemma":0.000002519787,"teacher_disagreement_score":0.47692662,"about_ca_system_score_codex":0.00024697804,"about_ca_system_score_gemma":0.000035451918,"threshold_uncertainty_score":0.9999127},"labels":[],"label_agreement":null},{"id":"W2583679202","doi":"10.4230/lipics.aofa.2018.30","title":"Periods of Iterations of Mappings over Finite Fields with Restricted Preimage Sizes","year":2018,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Modulo; Mathematics; Product (mathematics); Combinatorics; Set (abstract data type); Discrete mathematics; Heuristic; Finite set; Mathematical analysis; Mathematical optimization; Geometry; Computer science","score_opus":0.013656057012199144,"score_gpt":0.24707481273719306,"score_spread":0.23341875572499393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2583679202","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3269811,0.00005169534,0.66485065,0.0001533955,0.0007286333,0.0011926595,0.0008691736,0.00018594768,0.004986718],"genre_scores_gemma":[0.91349036,0.00004532054,0.08541915,0.0002656959,0.000121891564,0.00013628569,0.0003348368,0.000034277993,0.00015216986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99706984,0.00007228675,0.0014141614,0.00039208878,0.0005656288,0.0004859935],"domain_scores_gemma":[0.99579036,0.00034601658,0.0013061283,0.0016760462,0.0007483551,0.0001330658],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046194124,0.00049562886,0.00074901036,0.00061375933,0.00021668618,0.00035375718,0.0019583602,0.00045591142,0.00005524314],"category_scores_gemma":[0.00014295144,0.00042393198,0.00043512828,0.00060484634,0.00045353975,0.00097481726,0.0014452802,0.0006808943,0.000007849689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0036463018,0.0047024693,0.05208861,0.027301917,0.0064061396,0.00004120285,0.33307877,0.009162699,0.0012687184,0.5079879,0.029610405,0.02470488],"study_design_scores_gemma":[0.021087931,0.010807816,0.031192461,0.014663623,0.0013164951,0.0001587786,0.004312635,0.64314306,0.026112814,0.10919283,0.1301446,0.007866942],"about_ca_topic_score_codex":0.000023703098,"about_ca_topic_score_gemma":0.000015093187,"teacher_disagreement_score":0.6339804,"about_ca_system_score_codex":0.000038329494,"about_ca_system_score_gemma":0.00022373564,"threshold_uncertainty_score":0.99982125},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; 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","score_opus":0.02315242208962659,"score_gpt":0.3028318129520669,"score_spread":0.2796793908624403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612636087","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49118745,0.00001937829,0.5020413,0.0010635058,0.000531173,0.00094166544,0.00018318169,0.00017803359,0.0038543586],"genre_scores_gemma":[0.907766,0.000025057354,0.091345936,0.00023126893,0.00012377877,0.00013433013,0.0001663278,0.00002408809,0.0001832239],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99779415,0.000021271677,0.0007524267,0.00034365896,0.00041137746,0.00067713513],"domain_scores_gemma":[0.99754936,0.00007716737,0.00039516893,0.0016595676,0.00016532504,0.0001534407],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009297354,0.00026777206,0.00033467246,0.000275337,0.000940721,0.0012482273,0.002307358,0.00014300914,0.000004917678],"category_scores_gemma":[0.00009307522,0.00025260347,0.0001147602,0.0002152426,0.00011173787,0.0028974866,0.00092513405,0.00038713653,0.00009334862],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012662551,0.0011508503,0.24599797,0.0009893136,0.00020908707,0.00004774126,0.038566153,0.0024185777,0.0015020306,0.030773766,0.0076989606,0.67051893],"study_design_scores_gemma":[0.0018285639,0.00013130502,0.042289354,0.0003252929,0.000009798334,0.000033001263,0.0005837318,0.94413346,0.0007090726,0.00039294545,0.009134793,0.00042870274],"about_ca_topic_score_codex":0.00016906981,"about_ca_topic_score_gemma":0.00010100996,"teacher_disagreement_score":0.9417149,"about_ca_system_score_codex":0.00012358674,"about_ca_system_score_gemma":0.00008402547,"threshold_uncertainty_score":0.9999926},"labels":[],"label_agreement":null},{"id":"W2724706363","doi":"10.4230/lipics.socg.2017.27","title":"Orthogonal Range Searching in Moderate Dimensions: k-d Trees and Range Trees Strike Back","year":2017,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Sublinear function; Dimension (graph theory); Discrete mathematics; Binary logarithm; Randomized algorithm; Data structure; Constant (computer programming); Computer science","score_opus":0.0315930621693897,"score_gpt":0.2854385854838485,"score_spread":0.25384552331445875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2724706363","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78791744,0.00017576815,0.20773754,0.000711402,0.00053892995,0.0008559784,0.00015843101,0.000076451484,0.0018280542],"genre_scores_gemma":[0.964083,0.00010522797,0.034712467,0.00043541554,0.0001239008,0.000058342113,0.0001256598,0.000018022443,0.00033796654],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791366,0.00006211005,0.00070997037,0.00032941785,0.00045534354,0.0005295041],"domain_scores_gemma":[0.9983884,0.00020911699,0.00034021112,0.00069233874,0.00018116822,0.0001887586],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008092189,0.00029423842,0.00036474149,0.0003556456,0.0008270829,0.0012067872,0.00085477275,0.00012829834,0.000012905339],"category_scores_gemma":[0.000146959,0.00026757934,0.00012052049,0.00018194626,0.000111747555,0.0031454705,0.00059931044,0.00030548728,0.000047185946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014810851,0.0015081079,0.19947991,0.0015024431,0.0006090903,0.00010896326,0.048000187,0.051163074,0.0009699575,0.20085049,0.006559317,0.48776737],"study_design_scores_gemma":[0.004865614,0.00018854794,0.05955894,0.00019094418,0.000014959062,0.00004986098,0.0002105205,0.92276096,0.00028408863,0.0036049217,0.007752001,0.00051860913],"about_ca_topic_score_codex":0.000037996153,"about_ca_topic_score_gemma":0.00031991513,"teacher_disagreement_score":0.87159795,"about_ca_system_score_codex":0.00007237952,"about_ca_system_score_gemma":0.000113351125,"threshold_uncertainty_score":0.99997765},"labels":[],"label_agreement":null},{"id":"W2727825080","doi":"10.4230/lipics.esa.2016.34","title":"On Interference Among Moving Sensors and Related Problems","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":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Voronoi diagram; Combinatorics; Interference (communication); Binary logarithm; Set (abstract data type); Log-log plot; Upper and lower bounds; Mathematics; Diagram; Discrete mathematics; Mathematical analysis; Computer science; Geometry; Statistics; Telecommunications","score_opus":0.010557863851427367,"score_gpt":0.22149315034837466,"score_spread":0.2109352864969473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2727825080","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5760439,0.000017043076,0.41992086,0.00048800203,0.00058834045,0.00050012534,0.000039220304,0.00016872167,0.0022337942],"genre_scores_gemma":[0.9908689,0.000022407177,0.0077940198,0.00027641474,0.000044313125,0.000045651537,0.000035471057,0.000015141601,0.0008976722],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982854,0.000038166952,0.0006703484,0.00029181628,0.00031179152,0.00040249116],"domain_scores_gemma":[0.9986508,0.0002960316,0.0002840893,0.00041408255,0.00019585749,0.00015914509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044118744,0.00024922416,0.00022475612,0.00028671735,0.00024424246,0.0003026051,0.00049122615,0.00013060751,0.000020703326],"category_scores_gemma":[0.00015997485,0.00017852597,0.00008937779,0.0002954427,0.00009295334,0.0017288078,0.0002839387,0.00017564223,0.000094574745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018573762,0.0007113975,0.017032074,0.00092535804,0.00049433217,0.000019845837,0.03081991,0.010679241,0.0028480557,0.49890175,0.007859888,0.4295224],"study_design_scores_gemma":[0.007907654,0.0016001989,0.020322101,0.0015880327,0.000046617024,0.00024143144,0.00042502105,0.89366955,0.0069783237,0.050435126,0.015028292,0.0017576745],"about_ca_topic_score_codex":0.0000039969514,"about_ca_topic_score_gemma":0.0000048809898,"teacher_disagreement_score":0.8829903,"about_ca_system_score_codex":0.00007528377,"about_ca_system_score_gemma":0.000040614006,"threshold_uncertainty_score":0.72800773},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Compiler; Worst-case execution time; Parallel computing; Latency (audio); CAS latency; Scheme (mathematics); Embedded system; Operating system; Execution time; Memory controller; Semiconductor memory","score_opus":0.030260485462023687,"score_gpt":0.29869695360681403,"score_spread":0.26843646814479033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2733045287","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007715644,0.000021782276,0.97614795,0.00054115633,0.0004790585,0.001195585,0.00022219769,0.001381454,0.012295169],"genre_scores_gemma":[0.31101936,0.0000689171,0.6870788,0.00047597152,0.000052754112,0.00006916395,0.0006886004,0.00004198391,0.00050449924],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972752,0.00004919538,0.00081879075,0.0005667001,0.0005681648,0.0007219639],"domain_scores_gemma":[0.9943829,0.00007047893,0.00086973375,0.0042257383,0.00025853564,0.00019257242],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0006253181,0.00043727443,0.00046234162,0.0002594926,0.0013998318,0.0019113305,0.0065210206,0.00014317094,0.00000746902],"category_scores_gemma":[0.000052522937,0.00037146802,0.00009916533,0.0002005006,0.00016008654,0.0035801097,0.0032032744,0.00037971773,0.00005650598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011439614,0.003998578,0.04305464,0.0061176196,0.0047823233,0.00029030174,0.034195464,0.049430512,0.000098109675,0.1487395,0.1518491,0.55629987],"study_design_scores_gemma":[0.0019559427,0.00016133401,0.0025695362,0.0003487089,0.00003831936,0.000034122422,0.00011619682,0.9738129,0.0000740162,0.0007610748,0.019563714,0.00056416244],"about_ca_topic_score_codex":0.00002426324,"about_ca_topic_score_gemma":0.000036710244,"teacher_disagreement_score":0.9243824,"about_ca_system_score_codex":0.00010777984,"about_ca_system_score_gemma":0.000066456196,"threshold_uncertainty_score":0.9999002},"labels":[],"label_agreement":null},{"id":"W2734180996","doi":"10.4230/lipics.ecoop.2017.23","title":"Interprocedural Specialization of Higher-Order Dynamic Languages Without Static Analysis","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":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Compiler; Computer science; Programming language; Interprocedural optimization; Compile time; Function (biology); Register allocation; Optimizing compiler; Parallel computing; Functional programming; Just-in-time compilation; Static analysis; Identity (music); Loop optimization","score_opus":0.011184281094810195,"score_gpt":0.31666544997271834,"score_spread":0.30548116887790816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2734180996","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029361382,0.000026882275,0.9653204,0.000286279,0.00032653328,0.00042833696,0.000086679865,0.0002801789,0.003883343],"genre_scores_gemma":[0.81773406,0.000022592934,0.18116672,0.0002524308,0.00004139376,0.000025279169,0.00015197834,0.000017708928,0.00058782223],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980618,0.00003437459,0.0008960836,0.00024975196,0.0003771823,0.0003808313],"domain_scores_gemma":[0.9970911,0.00005965447,0.0010950089,0.0011887364,0.00046595206,0.00009950649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003793986,0.0002689289,0.0005161361,0.00043704527,0.0004111166,0.0006136542,0.0017329241,0.00012863526,0.000022915889],"category_scores_gemma":[0.00015626146,0.0002422323,0.00022498367,0.00042373,0.0001425642,0.0014811386,0.00047231143,0.00015957224,0.00001495833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059950014,0.0024347128,0.5186764,0.00476817,0.0068832273,0.000028361257,0.07177087,0.08198561,0.00039384986,0.19595619,0.018281192,0.09822196],"study_design_scores_gemma":[0.001002188,0.00013244024,0.010425408,0.000114881404,0.00013239772,0.0000056059594,0.00018769191,0.9833889,0.0007098029,0.0009246255,0.0025942086,0.00038186397],"about_ca_topic_score_codex":0.00003920659,"about_ca_topic_score_gemma":0.0000524778,"teacher_disagreement_score":0.9014033,"about_ca_system_score_codex":0.00007286491,"about_ca_system_score_gemma":0.000067734996,"threshold_uncertainty_score":0.98779464},"labels":[],"label_agreement":null},{"id":"W2747422829","doi":"10.4230/lipics.approx-random.2017.5","title":"Scheduling Problems over Network of Machines","year":2017,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Job shop scheduling; Computer science; Preemption; Scheduling (production processes); Flow shop scheduling; Schedule; Distributed computing; Mathematical optimization; Mathematics; Operating system","score_opus":0.025341678855584946,"score_gpt":0.29091071457535445,"score_spread":0.2655690357197695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2747422829","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031007739,0.00007906227,0.95116174,0.0008361419,0.0013328601,0.0013966027,0.0001017599,0.00022540095,0.013858699],"genre_scores_gemma":[0.68243825,0.00010480715,0.31544593,0.0007493246,0.00025877907,0.00010427098,0.00011159023,0.00004543453,0.0007415968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975142,0.000032733627,0.000979778,0.0002513026,0.000517504,0.00070446567],"domain_scores_gemma":[0.9969673,0.00008918496,0.00087078067,0.0014630763,0.0004110728,0.00019859022],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009050869,0.00028804145,0.00041767635,0.00012065292,0.0008361579,0.00095404196,0.0023814011,0.00016340041,0.00003918834],"category_scores_gemma":[0.00018968078,0.0002482759,0.00021377721,0.00018340857,0.00017226905,0.0028627568,0.00095171866,0.000312739,0.00004883305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018984926,0.0011707521,0.15285583,0.0037707514,0.00082044676,0.000011529689,0.027375216,0.19556518,0.00030482718,0.483161,0.016826523,0.1179481],"study_design_scores_gemma":[0.0022481047,0.00017314967,0.0033718103,0.00027591153,0.000013788774,0.000012507569,0.00005377175,0.9634679,0.00019409014,0.004841163,0.02494556,0.00040222885],"about_ca_topic_score_codex":0.000031609456,"about_ca_topic_score_gemma":0.000021861222,"teacher_disagreement_score":0.76790273,"about_ca_system_score_codex":0.000046447654,"about_ca_system_score_gemma":0.000102008475,"threshold_uncertainty_score":0.99999696},"labels":[],"label_agreement":null},{"id":"W2749142859","doi":"10.4230/lipics.wabi.2017.8","title":"A General Framework for Gene Tree Correction Based on Duplication-Loss Reconciliation","year":2017,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke; Université de Montréal","funders":"","keywords":"Supertree; Tree (set theory); Phylogenetic tree; Computer science; Set (abstract data type); Binary tree; K-ary tree; Gene duplication; Interval tree; Algorithm; Tree structure; Mathematics; Theoretical computer science; Combinatorics; Biology; Gene","score_opus":0.017443418923115017,"score_gpt":0.27683856830365866,"score_spread":0.25939514938054364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2749142859","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8521149,0.00006628932,0.1397409,0.0006786939,0.0024526431,0.0016678822,0.0009491816,0.000021968799,0.002307538],"genre_scores_gemma":[0.9657824,0.000082134946,0.029833652,0.001126819,0.0007992637,0.00057222275,0.0011833415,0.000044315002,0.0005758271],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985178,0.00001674417,0.0005502077,0.0003231699,0.00017201994,0.00042004994],"domain_scores_gemma":[0.9979401,0.000066559725,0.0005516632,0.0010029406,0.00033106102,0.00010766027],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032681462,0.00030077368,0.00027333962,0.0000735366,0.00083495665,0.00020315671,0.0004816895,0.00031676405,0.0000063647153],"category_scores_gemma":[0.0004267726,0.0002907577,0.00026385358,0.000038043487,0.00010368203,0.000012323846,0.00011388885,0.00013663586,0.000016081236],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.011806354,0.0035648341,0.27896002,0.0022815617,0.0035026872,0.0000056837844,0.0078044217,0.033349056,0.16313557,0.030483542,0.10467531,0.360431],"study_design_scores_gemma":[0.013496183,0.004115948,0.08485967,0.00025798217,0.00029964015,0.000034627836,0.00050665555,0.22216609,0.25747317,0.0062621473,0.40814942,0.002378465],"about_ca_topic_score_codex":0.000014803122,"about_ca_topic_score_gemma":0.00004065921,"teacher_disagreement_score":0.35805252,"about_ca_system_score_codex":0.00006029377,"about_ca_system_score_gemma":0.000081448576,"threshold_uncertainty_score":0.99995446},"labels":[],"label_agreement":null},{"id":"W2751149696","doi":"10.4230/lipics.cpm.2023.26","title":"Acceleration of FM-Index Queries Through Prefix-Free Parsing","year":2017,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"International Max Planck Research School for Environmental, Cellular and Molecular Microbiology; Shurl and Kay Curci Foundation; California State University, Dominguez Hills; Gordon and Betty Moore Foundation; Pennsylvania Department of Health; National Institutes of Health; National Science Foundation","keywords":"Computer science; Identification (biology); Source code; Metric (unit); Data mining; Pattern recognition (psychology); Artificial intelligence; Biology","score_opus":0.02438688718006604,"score_gpt":0.28139486309643025,"score_spread":0.2570079759163642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751149696","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98082155,0.00022781995,0.00888712,0.00023064495,0.00060965284,0.00060553994,0.0005422913,0.000009621793,0.008065752],"genre_scores_gemma":[0.99309057,0.00027152876,0.0056886217,0.00021840559,0.00022953218,0.000041081676,0.00022652006,0.0000314556,0.00020226225],"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985481,0.000016095677,0.00064704835,0.0002119246,0.00019217527,0.0003846639],"domain_scores_gemma":[0.9978869,0.000017346323,0.00058598473,0.0011852095,0.00026070687,0.0000638455],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022371895,0.00026715206,0.00033362926,0.000040107036,0.00057878206,0.00018042843,0.0007570565,0.00021092671,0.000007930467],"category_scores_gemma":[0.00018419402,0.00024698902,0.00019303942,0.000029371742,0.00024918094,0.00002968455,0.0005870648,0.0001093839,0.0000051760508],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0040061516,0.0015859092,0.5143255,0.0039405376,0.0039269654,0.0000067335454,0.030801272,0.0014198518,0.32897097,0.026991513,0.037860267,0.046164308],"study_design_scores_gemma":[0.011863469,0.0023230745,0.089970015,0.00029092975,0.00024815887,0.00005792666,0.0041158753,0.003042031,0.476649,0.008859819,0.40066302,0.001916697],"about_ca_topic_score_codex":0.00004645842,"about_ca_topic_score_gemma":0.000107884574,"teacher_disagreement_score":0.4243555,"about_ca_system_score_codex":0.000019719944,"about_ca_system_score_gemma":0.000057113066,"threshold_uncertainty_score":0.9999982},"labels":[],"label_agreement":null},{"id":"W2753236625","doi":"10.4230/lipics.cpm.2017.5","title":"Path Queries on Functions","year":2017,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Combinatorics; Path (computing); Element (criminal law); Range (aeronautics); Function (biology); Mathematics; Domain (mathematical analysis); Binary logarithm; Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.020877183787311186,"score_gpt":0.273045631051949,"score_spread":0.25216844726463783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2753236625","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026565855,0.00003912094,0.94112974,0.0012536367,0.0040028556,0.000853346,0.0009186608,0.00042988715,0.024806911],"genre_scores_gemma":[0.8731352,0.00010336287,0.118604176,0.0026958296,0.0007588646,0.0002816489,0.0007668028,0.000072997085,0.0035811001],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99803966,0.000020152367,0.0005977533,0.00030479865,0.00046573352,0.0005719028],"domain_scores_gemma":[0.9966797,0.000088534776,0.00049627596,0.0023346168,0.0001936174,0.00020724443],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003558111,0.0003161521,0.00030863984,0.00014345536,0.0018349079,0.0016016794,0.0022779463,0.00015459362,0.00003095775],"category_scores_gemma":[0.00013993966,0.00025403744,0.00018642069,0.00008713316,0.0001419878,0.0038148921,0.0010536211,0.00032678863,0.00045004726],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032915303,0.001392081,0.009743359,0.0007864496,0.00035586924,0.00004240939,0.0118455775,0.0002580172,0.00012925982,0.3092946,0.24255058,0.4232726],"study_design_scores_gemma":[0.0029596905,0.0006622439,0.008538288,0.00033049632,0.000025727122,0.00005384491,0.0005173674,0.15765563,0.00069212134,0.0032065075,0.82448816,0.0008699011],"about_ca_topic_score_codex":0.00003430063,"about_ca_topic_score_gemma":0.0000115425155,"teacher_disagreement_score":0.84656936,"about_ca_system_score_codex":0.00006502485,"about_ca_system_score_gemma":0.000070795024,"threshold_uncertainty_score":0.9999912},"labels":[],"label_agreement":null},{"id":"W2756932492","doi":"10.4230/lipics.cosit.2017.12","title":"Targeted Cognitive Training of Spatial Skills: Perspective Taking in Robot Teleoperation","year":2017,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Spatial Cognition and Navigation","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Teleoperation; Perspective (graphical); Robot; Computer science; Training (meteorology); Human–computer interaction; Cognition; Psychology; Artificial intelligence; Neuroscience; Geography","score_opus":0.02303822077972452,"score_gpt":0.2867509318269888,"score_spread":0.2637127110472643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2756932492","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8892092,0.000039548268,0.094379,0.00006176424,0.00079908984,0.0011800817,0.0004988363,0.00016515156,0.01366735],"genre_scores_gemma":[0.99730146,0.000024474051,0.001849785,0.00007515723,0.0001362465,0.000089990994,0.00046522936,0.000040404542,0.000017282484],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984241,0.000021932521,0.0007643042,0.00014836754,0.00026943447,0.00037186375],"domain_scores_gemma":[0.9987375,0.00009260313,0.00042767185,0.0002500784,0.00041096992,0.000081164995],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030978394,0.0002564306,0.00036974033,0.00026147446,0.0002688392,0.00018059439,0.00025149036,0.00018439745,0.00007050189],"category_scores_gemma":[0.0005596229,0.00026971914,0.00012481736,0.000109550194,0.000104070146,0.0012118302,0.00005514931,0.00032178688,0.000024869138],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012493067,0.0013434878,0.08393736,0.002556503,0.0012879197,0.000033374323,0.3804749,0.026583528,0.010693846,0.007585577,0.00040318916,0.48385102],"study_design_scores_gemma":[0.016879505,0.00063997635,0.18446836,0.0022447277,0.00017553118,0.000034337347,0.041600358,0.67965454,0.07053164,0.00135064,0.0007517228,0.0016686617],"about_ca_topic_score_codex":0.00020148845,"about_ca_topic_score_gemma":0.0004940526,"teacher_disagreement_score":0.653071,"about_ca_system_score_codex":0.0001608206,"about_ca_system_score_gemma":0.000045922843,"threshold_uncertainty_score":0.9999755},"labels":[],"label_agreement":null},{"id":"W2757110170","doi":"10.4230/lipics.cosit.2017.2","title":"A New Perspective on the Mereotopology of RCC8","year":2017,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Binary relation; Axiom; Conservative extension; Extension (predicate logic); Disjoint sets; Isomorphism (crystallography); Set theory; Mathematics; Characterization (materials science); Interpretation (philosophy); Pairwise comparison; Perspective (graphical); Computer science; Set (abstract data type); Algebra over a field; Theoretical computer science; Discrete mathematics; Pure mathematics; Artificial intelligence","score_opus":0.02455929192061818,"score_gpt":0.30054820678367833,"score_spread":0.27598891486306015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2757110170","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07238407,0.00008460163,0.82642514,0.012201275,0.0020089757,0.0017838258,0.00012951494,0.00021444866,0.084768154],"genre_scores_gemma":[0.9736553,0.000021692947,0.023758497,0.0016275122,0.0001469334,0.00004531379,0.000008541137,0.00001770583,0.000718512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983424,0.000031493302,0.00054781715,0.00024005282,0.00033278513,0.000505467],"domain_scores_gemma":[0.996956,0.0002383232,0.0006894336,0.0017383868,0.00024202093,0.00013582486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003386245,0.0002676992,0.00035993988,0.00011656008,0.000718249,0.00028284188,0.0028445395,0.00012715912,0.0000454449],"category_scores_gemma":[0.00033632052,0.0001753227,0.00022617284,0.00011071731,0.0002722436,0.0011815157,0.0006326914,0.0003301185,0.00011704843],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004663393,0.0000798234,0.0005129161,0.000033215056,0.00007641065,0.0000026203725,0.008710317,0.00003324631,0.000033046537,0.9787775,0.00310202,0.008592207],"study_design_scores_gemma":[0.010818733,0.0034211609,0.011805865,0.00045552923,0.00012134746,0.00020928771,0.017571319,0.054468818,0.018466955,0.72718316,0.15331347,0.0021643639],"about_ca_topic_score_codex":0.000066628396,"about_ca_topic_score_gemma":0.00002494497,"teacher_disagreement_score":0.9012712,"about_ca_system_score_codex":0.00008982072,"about_ca_system_score_gemma":0.00010948361,"threshold_uncertainty_score":0.7149452},"labels":[],"label_agreement":null},{"id":"W2760543158","doi":"10.4230/lipics.fscd.2017.13","title":"There Is Only One Notion of Differentiation","year":2017,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Differential (mechanical device); Mathematics; Coalgebra; Differential calculus; Category theory; Linear logic; Categorical variable; Algebra over a field; Calculus (dental); Pure mathematics; Discrete mathematics","score_opus":0.029348905077160776,"score_gpt":0.2623765621112201,"score_spread":0.23302765703405934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2760543158","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1365304,0.000051927884,0.84511316,0.00049655326,0.001659659,0.0010981526,0.000071661096,0.00017518802,0.014803289],"genre_scores_gemma":[0.9937119,0.00002091009,0.0052940627,0.00017682457,0.00013099205,0.000034946504,0.00008093928,0.000017206003,0.0005322548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9980462,0.00002732447,0.0007949255,0.00022226525,0.00048168187,0.00042757866],"domain_scores_gemma":[0.99710363,0.000042905715,0.0010781023,0.001346649,0.0003199941,0.00010870593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044722258,0.0002421104,0.00037870504,0.00013065727,0.0005104739,0.0007008586,0.0015855669,0.00018765272,0.000020642505],"category_scores_gemma":[0.000073350275,0.00020330587,0.00021950876,0.00008985921,0.00010183292,0.0019281242,0.00041190532,0.00018032486,0.00011994755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000099862395,0.0011583465,0.080241136,0.0020313915,0.0005181012,0.0000038014634,0.028020179,0.000017890005,0.0004254699,0.6512313,0.0029117449,0.23334077],"study_design_scores_gemma":[0.021387612,0.0032433232,0.3548717,0.000701757,0.00038110936,0.00015005373,0.0028713318,0.2758523,0.035833746,0.09578086,0.20494783,0.0039784033],"about_ca_topic_score_codex":0.00008029929,"about_ca_topic_score_gemma":0.00004137635,"teacher_disagreement_score":0.8571815,"about_ca_system_score_codex":0.000057778176,"about_ca_system_score_gemma":0.00006231901,"threshold_uncertainty_score":0.8290573},"labels":[],"label_agreement":null},{"id":"W2768429747","doi":"10.4230/lipics.icalp.2018.29","title":"Interpolating between $k$-Median and $k$-Center: Approximation Algorithms for Ordered $k$-Median","year":2017,"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":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Approximation algorithm; Metric space; Center (category theory); Algorithm; Discrete mathematics","score_opus":0.059524760361767445,"score_gpt":0.2948647382965404,"score_spread":0.23533997793477296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2768429747","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31233227,0.00024822165,0.59712887,0.0141807245,0.018467443,0.024660219,0.008420133,0.0017132472,0.022848908],"genre_scores_gemma":[0.93155473,0.00015105169,0.02838937,0.0023584403,0.0047342703,0.0020030611,0.029715206,0.00025422036,0.0008396383],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99537975,0.000019541192,0.0021067678,0.0007606871,0.0006677682,0.001065463],"domain_scores_gemma":[0.9962252,0.00009664566,0.0014643867,0.0013234719,0.0007647029,0.00012558553],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014719366,0.0009453563,0.0010736461,0.0008486206,0.001060922,0.0023323328,0.0014206475,0.00063974556,0.00006993093],"category_scores_gemma":[0.000625267,0.00095478806,0.00048774685,0.00017972689,0.00023337043,0.0027871267,0.002147135,0.00079124613,0.00016189853],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074122165,0.0015367342,0.10778982,0.08135401,0.0033530435,0.000007933252,0.017819976,0.0010834846,0.000036866448,0.017258158,0.06664816,0.7023706],"study_design_scores_gemma":[0.006713656,0.000100737416,0.00394138,0.001516757,0.0005588535,0.0000036974666,0.0032149432,0.64155763,0.000035150846,0.011027277,0.32920584,0.0021240637],"about_ca_topic_score_codex":0.0005567459,"about_ca_topic_score_gemma":0.00051826943,"teacher_disagreement_score":0.7002465,"about_ca_system_score_codex":0.00019026952,"about_ca_system_score_gemma":0.00008449041,"threshold_uncertainty_score":0.9992903},"labels":[],"label_agreement":null},{"id":"W2772933217","doi":"10.4230/lipics.disc.2017.12","title":"On the Number of Objects with Distinct Power and the Linearizability of Set Agreement Objects","year":2017,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Linearizability; Computer science; Set (abstract data type); Algorithm; Programming language","score_opus":0.014070423245765592,"score_gpt":0.2588253246099194,"score_spread":0.24475490136415382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2772933217","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9023009,0.000031085085,0.02110091,0.0006339624,0.00050202827,0.0016129023,0.00015786164,0.00004761183,0.07361274],"genre_scores_gemma":[0.9974372,0.00000952139,0.0020112128,0.00024032108,0.000032142718,0.00005020054,0.000012864347,0.0000116737565,0.00019486903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9981432,0.00007977558,0.0006550181,0.00022987703,0.00049337273,0.00039878485],"domain_scores_gemma":[0.9962591,0.00062183366,0.0008867505,0.0017930145,0.00034386409,0.00009545841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013110045,0.00028505566,0.0004555047,0.000043341104,0.0006163282,0.00034364898,0.0017065331,0.00009486136,0.000027145179],"category_scores_gemma":[0.0005696696,0.00013422659,0.00017235542,0.00011234838,0.000871819,0.00060497335,0.0007629663,0.00026614894,0.000024806486],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015654162,0.0011514928,0.16263573,0.0014367702,0.0008034792,0.000007799889,0.13768394,0.000049257244,0.000034680914,0.6849796,0.0028063785,0.006845432],"study_design_scores_gemma":[0.06950064,0.007064869,0.49048337,0.0035222443,0.0007435475,0.0004897209,0.018704869,0.25890657,0.019719284,0.10511115,0.021176374,0.004577367],"about_ca_topic_score_codex":0.00005786297,"about_ca_topic_score_gemma":0.00006673043,"teacher_disagreement_score":0.5798685,"about_ca_system_score_codex":0.00003499808,"about_ca_system_score_gemma":0.00009213412,"threshold_uncertainty_score":0.5473601},"labels":[],"label_agreement":null},{"id":"W2783084218","doi":"10.4230/lipics.isaac.2017.30","title":"Succinct Color Searching in One Dimension","year":2017,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Combinatorics; Dimension (graph theory); Set (abstract data type); Omega; Interval (graph theory); Rank (graph theory); Space (punctuation); Integer (computer science); Mathematics; Binary logarithm; Discrete mathematics; Point (geometry); Computer science; Physics; Geometry","score_opus":0.03602457941706265,"score_gpt":0.2935508951595492,"score_spread":0.2575263157424865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783084218","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5505157,0.00005639301,0.43858048,0.0013249186,0.0016452952,0.0015310558,0.0002563646,0.00026090528,0.005828839],"genre_scores_gemma":[0.90197295,0.000041992247,0.0968206,0.0005359478,0.00014133668,0.00006795054,0.00017177904,0.000028722681,0.00021869739],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99746805,0.00004236195,0.0008011714,0.00034770856,0.0005737474,0.00076696934],"domain_scores_gemma":[0.99713176,0.00013632995,0.0004924467,0.0018609874,0.00015962026,0.00021883484],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000945221,0.00029990324,0.00042544413,0.0002547922,0.0010251242,0.0012598151,0.0025778562,0.00016905504,0.000015273266],"category_scores_gemma":[0.00017972704,0.00026109107,0.00013441361,0.00013626573,0.000104801235,0.0044119605,0.0021725562,0.00046871076,0.00014286334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00090497656,0.0037351686,0.10674929,0.0023028813,0.00043644072,0.0002191608,0.04141696,0.0014715088,0.002945111,0.1563966,0.022494733,0.6609272],"study_design_scores_gemma":[0.0059192316,0.00042622455,0.04512439,0.00070029096,0.000016866858,0.00005082395,0.00032961788,0.8951166,0.0022783075,0.0029826292,0.046168454,0.0008865638],"about_ca_topic_score_codex":0.00015161154,"about_ca_topic_score_gemma":0.000072094546,"teacher_disagreement_score":0.8936451,"about_ca_system_score_codex":0.00011965045,"about_ca_system_score_gemma":0.00008699024,"threshold_uncertainty_score":0.99998415},"labels":[],"label_agreement":null},{"id":"W2783565018","doi":"10.20382/jocg.v9i1a15","title":"Routing on the Visibility Graph","year":2017,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Exploratory Research for Advanced Technology; Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada; Ministry of Education, Culture, Sports, Science and Technology; National Science Foundation","keywords":"Visibility graph; Equal-cost multi-path routing; Computer science; Combinatorics; Routing (electronic design automation); Static routing; Visibility; Graph; Theoretical computer science; Mathematics; Algorithm; Discrete mathematics; Computer network; Routing protocol; Geography","score_opus":0.04137934408100575,"score_gpt":0.2961158290571426,"score_spread":0.2547364849761369,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783565018","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10252394,0.000063236526,0.87594944,0.0032282753,0.0049682194,0.0024091522,0.00048232486,0.00033654273,0.010038847],"genre_scores_gemma":[0.973402,0.00003459713,0.022535503,0.002085591,0.00056128146,0.00026703635,0.00065860775,0.000034328124,0.0004210215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99660075,0.000107604596,0.0011868121,0.0005943717,0.00085961854,0.00065083336],"domain_scores_gemma":[0.9948198,0.00049671537,0.0012146186,0.002765628,0.0005331089,0.00017013866],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0020579894,0.0005670968,0.0005192966,0.00030013383,0.001315513,0.0021881147,0.003604947,0.00039539646,0.00001777686],"category_scores_gemma":[0.000526572,0.0004230889,0.0005404454,0.0002180954,0.00013882405,0.0010122324,0.0024299219,0.001165166,0.00013750348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000236903,0.0012775545,0.003093904,0.0021465896,0.0010562334,0.00001588425,0.024757788,0.05235258,0.000057289988,0.70020914,0.04069944,0.17409667],"study_design_scores_gemma":[0.0016903065,0.00031436663,0.004142673,0.00068399525,0.000070574555,0.00003341974,0.0002830709,0.8474855,0.0013044362,0.09579783,0.046825558,0.0013682762],"about_ca_topic_score_codex":0.000021466607,"about_ca_topic_score_gemma":0.000013543147,"teacher_disagreement_score":0.8708781,"about_ca_system_score_codex":0.00016978628,"about_ca_system_score_gemma":0.00027852075,"threshold_uncertainty_score":0.9999846},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.013770906717360573,"score_gpt":0.2611088724838626,"score_spread":0.24733796576650202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2787986197","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082311235,0.002403846,0.8710233,0.0014551088,0.014596787,0.010134384,0.00016495207,0.0014161873,0.016494213],"genre_scores_gemma":[0.99003273,0.00019233703,0.006076216,0.00073489815,0.0008202216,0.000979136,0.00024432375,0.00008491664,0.00083519355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99589854,0.00011187692,0.0013362825,0.0006759591,0.0008247583,0.0011525986],"domain_scores_gemma":[0.9957093,0.00041600125,0.0011022451,0.001884645,0.0005659497,0.000321861],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014930017,0.00078665465,0.00082082907,0.00020530946,0.0010026101,0.002659217,0.0032713753,0.0006447484,0.0000041502008],"category_scores_gemma":[0.00017325906,0.0005278076,0.00036093197,0.00026948052,0.00042722563,0.00096577377,0.0026900962,0.00095858873,0.00017671657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023199864,0.00090600864,0.016507948,0.028064106,0.0027630378,0.000052985484,0.0877539,0.00010665451,0.000014795853,0.56512463,0.03717615,0.2612978],"study_design_scores_gemma":[0.0064595067,0.0018810963,0.0025146722,0.00087697175,0.00041796884,0.00041935433,0.0016319453,0.11258163,0.002121049,0.240574,0.6263616,0.004160198],"about_ca_topic_score_codex":0.00003625412,"about_ca_topic_score_gemma":0.000037814112,"teacher_disagreement_score":0.9077215,"about_ca_system_score_codex":0.000115270035,"about_ca_system_score_gemma":0.00023350849,"threshold_uncertainty_score":0.99971735},"labels":[],"label_agreement":null},{"id":"W2788862636","doi":"10.20382/jocg.v11i1a16","title":"Faster Algorithms for some Optimization Problems on Collinear Points","year":2018,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Disjoint sets; Interval (graph theory); Dimension (graph theory); Algorithm; Point (geometry); Running time; Range (aeronautics); Set (abstract data type); Server; Computer science; Combinatorics; Mathematics; Geometry; Computer network","score_opus":0.03458544815699344,"score_gpt":0.2824341130306675,"score_spread":0.24784866487367407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788862636","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004755798,0.000043326614,0.9837262,0.00088225317,0.0044396026,0.004057385,0.0012660086,0.0002926156,0.00053680403],"genre_scores_gemma":[0.022214506,0.000088087385,0.95911855,0.00399011,0.002371731,0.0016939801,0.009092504,0.00012889018,0.0013016567],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961398,0.00006036137,0.0015266177,0.0007250011,0.00079257536,0.0007555907],"domain_scores_gemma":[0.99632156,0.0002403538,0.0010036675,0.0011137177,0.001082935,0.00023776996],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009849828,0.0006796931,0.00064821827,0.0006336852,0.0004954534,0.0011889314,0.0015772743,0.0004979653,0.00002332833],"category_scores_gemma":[0.00015641215,0.0006526363,0.00043447546,0.00035321643,0.00009058456,0.0015931226,0.0010631651,0.0005212987,0.00013173718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017471537,0.00063474936,0.000046526347,0.0018817292,0.0003579699,0.0000019925087,0.004212403,0.9400624,0.000011106505,0.014633484,0.019053375,0.018929565],"study_design_scores_gemma":[0.0021776727,0.0006141237,0.000022194788,0.00034063632,0.00004262148,0.000015284564,0.000043904656,0.95105,0.00077424414,0.007452339,0.036762852,0.00070414814],"about_ca_topic_score_codex":0.0000039909787,"about_ca_topic_score_gemma":0.000002534531,"teacher_disagreement_score":0.024607671,"about_ca_system_score_codex":0.00025810456,"about_ca_system_score_gemma":0.00030531327,"threshold_uncertainty_score":0.99984795},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.016344549135428415,"score_gpt":0.26225920579889506,"score_spread":0.24591465666346665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2793662473","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2372081,0.000029586592,0.7527116,0.000090428715,0.0009205973,0.0007787402,0.0002252198,0.00054861594,0.0074871504],"genre_scores_gemma":[0.864177,0.000009724588,0.13440612,0.00067861006,0.0002125953,0.000062245475,0.0002869616,0.00004284702,0.00012389707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99683136,0.000067495006,0.0012477882,0.00041151413,0.0006273738,0.00081445434],"domain_scores_gemma":[0.99671346,0.000109537985,0.00059942866,0.0019385512,0.00036017856,0.00027886318],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011039027,0.00042601934,0.00058106607,0.00032773343,0.0003090301,0.00034169038,0.0027618501,0.00025208775,0.000036852354],"category_scores_gemma":[0.00005642808,0.00036291318,0.0002442482,0.00053811294,0.00034829328,0.0028988977,0.0007071823,0.0002603018,0.00015084745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005158081,0.005207084,0.010187434,0.004318188,0.001252878,0.000026221825,0.11998142,0.00020977418,0.0039939974,0.47001556,0.016496906,0.36779472],"study_design_scores_gemma":[0.0034375752,0.0012126494,0.0018621983,0.00016091642,0.000046428395,0.00022356848,0.0015575015,0.95455414,0.0087543,0.00822601,0.018992523,0.0009721816],"about_ca_topic_score_codex":0.000026743443,"about_ca_topic_score_gemma":0.000005384785,"teacher_disagreement_score":0.9543444,"about_ca_system_score_codex":0.000062717576,"about_ca_system_score_gemma":0.00009004835,"threshold_uncertainty_score":0.9998823},"labels":[],"label_agreement":null},{"id":"W2794549768","doi":"10.4230/lipics.opodis.2017.11","title":"Evacuating an Equilateral Triangle in the Face-to-Face Model","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; University of Waterloo; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Concordia University","keywords":"Robot; Upper and lower bounds; Equilateral triangle; Face (sociological concept); Combinatorics; Computer science; Boundary (topology); Mathematics; Artificial intelligence; Geometry; Mathematical analysis","score_opus":0.052625107559147274,"score_gpt":0.33286018274123674,"score_spread":0.28023507518208945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794549768","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10912052,0.000006198419,0.88184565,0.0016672845,0.00032623313,0.0015522308,0.000077034674,0.00016437165,0.005240445],"genre_scores_gemma":[0.8798011,0.0000046216464,0.114579424,0.004855534,0.00011716526,0.00014513831,0.00009320017,0.000026136395,0.00037768102],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99719864,0.00011175471,0.00090946065,0.0003084124,0.00062473066,0.00084702915],"domain_scores_gemma":[0.9981622,0.000110426336,0.00021509774,0.0010003876,0.0002790319,0.00023285983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017992433,0.00028830284,0.0003089726,0.0003150809,0.0004116658,0.00094330916,0.0023668471,0.00013509054,0.000023543203],"category_scores_gemma":[0.00013820628,0.00021393334,0.000118478965,0.00068415666,0.00008921382,0.0027325025,0.00052685663,0.00033643917,0.00023452808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003354635,0.0013031666,0.002186987,0.00040693567,0.0001276612,0.000010910153,0.61740446,0.2247853,0.00047997924,0.07736418,0.013436034,0.06215891],"study_design_scores_gemma":[0.0016752387,0.00045008902,0.00012256076,0.000051721498,0.0000044981784,0.000012633977,0.0016940737,0.9897702,0.0002505977,0.0014424673,0.0042296164,0.00029630656],"about_ca_topic_score_codex":0.000016946504,"about_ca_topic_score_gemma":0.00004894206,"teacher_disagreement_score":0.7706806,"about_ca_system_score_codex":0.00009570247,"about_ca_system_score_gemma":0.000114501716,"threshold_uncertainty_score":0.9096352},"labels":[],"label_agreement":null},{"id":"W2798279120","doi":"10.20382/jocg.v12i2a2","title":"Extending Drawings of Graphs to Arrangements of Pseudolines","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":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Consejo Nacional de Ciencia y Tecnología; European Commission","keywords":"Computer science","score_opus":0.017000399652586207,"score_gpt":0.2873462560179413,"score_spread":0.2703458563653551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2798279120","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40050521,0.00001602754,0.59677976,0.0001603206,0.000796285,0.00044157534,0.000068627065,0.000047590067,0.001184584],"genre_scores_gemma":[0.8780645,0.0000073871174,0.12114852,0.00045107654,0.00012516255,0.000027037553,0.000056079745,0.000011106153,0.000109095745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808466,0.000019982668,0.0009101522,0.00019139699,0.00046146268,0.00033231702],"domain_scores_gemma":[0.9982379,0.000084449515,0.0004179989,0.00045200583,0.0006861771,0.00012144504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005022407,0.00019100761,0.00030097584,0.0005193663,0.00016094153,0.00009225085,0.00077956,0.00007269875,0.000016799611],"category_scores_gemma":[0.000103255894,0.00017956461,0.00015318202,0.00079769996,0.00008475016,0.0009928267,0.00030575643,0.00008021135,0.00003503841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006622612,0.0020094207,0.022368276,0.003148063,0.00095727516,0.00000477081,0.08598279,0.005672456,0.036400665,0.46256122,0.028947176,0.35128564],"study_design_scores_gemma":[0.00923156,0.004483675,0.021998376,0.0012447714,0.00015325318,0.0000927252,0.0018256004,0.44813782,0.35369104,0.041186403,0.11578959,0.0021651685],"about_ca_topic_score_codex":0.00000880731,"about_ca_topic_score_gemma":0.000005439423,"teacher_disagreement_score":0.47755933,"about_ca_system_score_codex":0.000029688383,"about_ca_system_score_gemma":0.00005322295,"threshold_uncertainty_score":0.7322432},"labels":[],"label_agreement":null},{"id":"W2798438706","doi":"10.4230/lipics.itcs.2019.52","title":"Lower Bounds for Tolerant Junta and Unateness Testing via Rejection Sampling of Graphs","year":2018,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Property testing; Omega; Combinatorics; Discrete mathematics; Computer science; Computerized adaptive testing; Graph; Sampling (signal processing); Mathematics; Theoretical computer science; Statistics; Physics","score_opus":0.053714843414863066,"score_gpt":0.29322430157427337,"score_spread":0.2395094581594103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2798438706","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13563283,0.000103845254,0.8566619,0.000106782674,0.004333982,0.0017801241,0.00063888374,0.0002519781,0.000489647],"genre_scores_gemma":[0.45259362,0.000056788354,0.5455556,0.00037396248,0.00042450122,0.00037003064,0.00048260597,0.000084305866,0.000058594193],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961085,0.00004276357,0.0017641446,0.0006880589,0.0005626291,0.0008339088],"domain_scores_gemma":[0.995544,0.0004944075,0.0012764453,0.0013252714,0.0011596744,0.00020020596],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012714257,0.00067463267,0.00093864574,0.00066036097,0.0006836349,0.00079949124,0.001741522,0.0005222992,0.000005252267],"category_scores_gemma":[0.00022180151,0.0006592574,0.00047151605,0.0005524405,0.00038370528,0.0010998987,0.002185241,0.0006796125,0.000004383841],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020022443,0.0040933476,0.025583103,0.05370251,0.004200562,0.000024880383,0.060607858,0.008588837,0.0014906843,0.16024771,0.0061861,0.67327213],"study_design_scores_gemma":[0.0026781613,0.0009317487,0.0015001531,0.0017662323,0.00014425887,0.0001233704,0.00028147842,0.8492724,0.0013507257,0.13079484,0.009797125,0.001359519],"about_ca_topic_score_codex":0.00010237781,"about_ca_topic_score_gemma":0.0000328589,"teacher_disagreement_score":0.8406836,"about_ca_system_score_codex":0.00011312566,"about_ca_system_score_gemma":0.00018033723,"threshold_uncertainty_score":0.99958587},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.014313323477263336,"score_gpt":0.2540391938587569,"score_spread":0.23972587038149357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2798468821","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41494054,0.00008704757,0.58176214,0.00021322501,0.00061310193,0.0006182165,0.0001269622,0.00014439496,0.0014943952],"genre_scores_gemma":[0.94625235,0.000049910574,0.052614246,0.00053710176,0.00010480003,0.00006822023,0.0002453932,0.00001763267,0.00011037588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980488,0.00004018807,0.00075151486,0.0003129516,0.00035259943,0.00049395143],"domain_scores_gemma":[0.9987275,0.00011201035,0.0002402207,0.0004677422,0.00029508016,0.00015745436],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005095346,0.00027955635,0.00028582534,0.0003899231,0.0003218351,0.00041901862,0.0006022977,0.000120730154,0.0000099021445],"category_scores_gemma":[0.000053742056,0.000256342,0.000076902725,0.0008540256,0.00016448073,0.0017680599,0.00028893576,0.00020087534,0.000030135097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002705857,0.001011022,0.06973624,0.00074224756,0.0001804612,0.000023042809,0.025883803,0.00046749716,0.00043857517,0.6891161,0.0033620442,0.20876835],"study_design_scores_gemma":[0.002611784,0.00041607537,0.016902862,0.00017451997,0.00001842209,0.000064257074,0.00052302267,0.90933967,0.0016747343,0.026757669,0.040783666,0.00073332083],"about_ca_topic_score_codex":0.000011581323,"about_ca_topic_score_gemma":0.000108714645,"teacher_disagreement_score":0.9088722,"about_ca_system_score_codex":0.000046285335,"about_ca_system_score_gemma":0.00006539116,"threshold_uncertainty_score":0.99998885},"labels":[],"label_agreement":null},{"id":"W2799196781","doi":"10.4230/lipics.mfcs.2018.75","title":"Reconfiguration of Graph Minors","year":2018,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Control reconfiguration; Vertex (graph theory); Mathematics; Graph; Edge contraction; Vertex connectivity; Discrete mathematics; Computer science; Line graph; Graph power","score_opus":0.02228317346872367,"score_gpt":0.25909982572182005,"score_spread":0.2368166522530964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2799196781","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07355288,0.00009085909,0.89292246,0.0002658103,0.012346328,0.0020928462,0.0005000368,0.00030970635,0.017919097],"genre_scores_gemma":[0.96600443,0.000079556696,0.030206526,0.0005878789,0.0009984105,0.0003223894,0.0007926508,0.000065561006,0.0009426015],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959201,0.00009165516,0.0022680166,0.00048828445,0.0005923304,0.0006395786],"domain_scores_gemma":[0.9951815,0.0001338377,0.0018067342,0.001671071,0.0010302924,0.00017657058],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011011777,0.0005636107,0.00086732185,0.0005531443,0.00023893362,0.0005853044,0.0021243047,0.00072318834,0.000052371226],"category_scores_gemma":[0.000081350765,0.0005159571,0.000645683,0.00032585592,0.00015171996,0.0010877845,0.00096875295,0.0006651497,0.0001073358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00078834913,0.0022254956,0.009010551,0.021979732,0.0044860165,0.000024045075,0.1315372,0.009950743,0.000410476,0.25486776,0.4399827,0.12473693],"study_design_scores_gemma":[0.0039636805,0.0013436094,0.00084830436,0.0031409569,0.0001653938,0.0001854167,0.0016667729,0.79687536,0.0069315303,0.022657938,0.1595735,0.002647514],"about_ca_topic_score_codex":0.00006963131,"about_ca_topic_score_gemma":0.000050388346,"teacher_disagreement_score":0.8924515,"about_ca_system_score_codex":0.00013765268,"about_ca_system_score_gemma":0.00017139784,"threshold_uncertainty_score":0.9997292},"labels":[],"label_agreement":null},{"id":"W2800605324","doi":"10.4230/lipics.disc.2018.21","title":"An Almost Tight RMR Lower Bound for Abortable Test-And-Set","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":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Swap (finance); Computer science; Omega; Constant (computer programming); Set (abstract data type); Upper and lower bounds; Cache; Theoretical computer science; Parallel computing; Mathematics; Programming language","score_opus":0.018384321435701824,"score_gpt":0.2866736917350727,"score_spread":0.26828937029937083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2800605324","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07600279,0.0003616108,0.8839514,0.0005781122,0.008427931,0.005818084,0.019449525,0.0007453536,0.004665184],"genre_scores_gemma":[0.85066235,0.00018932743,0.12854873,0.003064475,0.0023574987,0.0024471015,0.0099645825,0.0002842454,0.0024816976],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9948712,0.000046791254,0.0019767112,0.0009893919,0.0007317061,0.0013841715],"domain_scores_gemma":[0.99424773,0.00026699493,0.0011938231,0.0026530754,0.0010910545,0.0005473053],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012447111,0.0009675015,0.00118314,0.0002862541,0.0007286788,0.0028643608,0.0031913645,0.0008616342,0.000029190427],"category_scores_gemma":[0.00017343783,0.00088199927,0.0004387415,0.00031137277,0.00026505112,0.0024016572,0.0014105488,0.000761313,0.00012325161],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010485429,0.0059444574,0.028233387,0.026253896,0.0029648938,0.000083941704,0.056825668,0.0017648744,0.0004232559,0.089396544,0.7295418,0.05751875],"study_design_scores_gemma":[0.003178247,0.0009923875,0.0009051847,0.00088127627,0.00010144135,0.00008774491,0.0003293293,0.3367929,0.00038441044,0.004257454,0.65035796,0.0017316823],"about_ca_topic_score_codex":0.00006693677,"about_ca_topic_score_gemma":0.00005038997,"teacher_disagreement_score":0.7746596,"about_ca_system_score_codex":0.00019661336,"about_ca_system_score_gemma":0.00037867212,"threshold_uncertainty_score":0.99936306},"labels":[],"label_agreement":null},{"id":"W2804358784","doi":"10.4230/lipics.aofa.2018.36","title":"Average Cost of QuickXsort with Pivot Sampling","year":2018,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Quicksort; Sorting; Selection (genetic algorithm); Term (time); Mathematical optimization; Sampling (signal processing); Computer science; Isolation (microbiology); Matching (statistics); Linear programming; sort; Algorithm; Mathematics; Sorting algorithm; Statistics; Arithmetic; Artificial intelligence","score_opus":0.03303782809232589,"score_gpt":0.2881667979971099,"score_spread":0.25512896990478406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2804358784","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021231072,0.00006750715,0.97021425,0.00009965165,0.0018352234,0.001892315,0.0018442856,0.0002594521,0.0025562511],"genre_scores_gemma":[0.34436804,0.00016092122,0.6497733,0.0008295496,0.0007101103,0.00040254826,0.0033238507,0.0001360759,0.00029562382],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99567246,0.00004663252,0.0016870026,0.0006734426,0.0010192372,0.0009012162],"domain_scores_gemma":[0.99449646,0.00017236361,0.0015290511,0.0026849036,0.0008095228,0.00030771372],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00079487375,0.00075693236,0.0010137177,0.00040203633,0.00035726101,0.0006979943,0.0035194517,0.00052776403,0.00003874184],"category_scores_gemma":[0.00006820892,0.0006027505,0.00033416136,0.00031400553,0.00025931688,0.0016329064,0.004555315,0.000963887,0.000074994015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0038824894,0.008379561,0.042367723,0.045474406,0.006970486,0.00018975238,0.12992014,0.070668645,0.0005281126,0.10124906,0.12625088,0.46411875],"study_design_scores_gemma":[0.0060587027,0.0012780275,0.0020002024,0.0043803626,0.00015070345,0.00017918932,0.0005157728,0.7967865,0.002904473,0.0046422416,0.17840382,0.0027000112],"about_ca_topic_score_codex":0.00007382107,"about_ca_topic_score_gemma":0.000018959447,"teacher_disagreement_score":0.72611785,"about_ca_system_score_codex":0.00016327218,"about_ca_system_score_gemma":0.00038024096,"threshold_uncertainty_score":0.9996424},"labels":[],"label_agreement":null},{"id":"W2804472712","doi":"10.4230/lipics.cpm.2018.6","title":"Nearest constrained circular words","year":2018,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Point (geometry); Computer science; Word (group theory); Polynomial; Dynamic programming; Algorithm; Time complexity; Mathematical optimization; Mathematics; Geometry; Mathematical analysis","score_opus":0.017279605229506646,"score_gpt":0.2567727694223453,"score_spread":0.23949316419283864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2804472712","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09206233,0.00024615403,0.88045096,0.0007931679,0.0072189537,0.002687601,0.0016903215,0.0014957583,0.013354764],"genre_scores_gemma":[0.86242825,0.00011287383,0.12860285,0.0040142126,0.0013818549,0.00051326124,0.0021943802,0.00018278841,0.0005695135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99487144,0.00009981918,0.0018767398,0.00084334996,0.0009385224,0.0013701186],"domain_scores_gemma":[0.99453133,0.00023826008,0.0011284947,0.0031185336,0.0005356932,0.00044770824],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013860285,0.0010004909,0.0010854289,0.00049897574,0.0004982209,0.001897297,0.0047890795,0.00092171517,0.00011976383],"category_scores_gemma":[0.00019128738,0.00094242406,0.00075232144,0.0004014327,0.00051513687,0.0014340074,0.004185167,0.0012844717,0.00057359616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055784726,0.0036953276,0.009098615,0.020679275,0.005592508,0.0003884531,0.116844185,0.0024865877,0.0005157081,0.44292408,0.1670735,0.23014392],"study_design_scores_gemma":[0.0059682387,0.0006315061,0.0010035745,0.0021763497,0.00022524223,0.00042017904,0.0016207778,0.6794487,0.0016830744,0.0634614,0.2392889,0.004072013],"about_ca_topic_score_codex":0.00002865982,"about_ca_topic_score_gemma":0.0000071774875,"teacher_disagreement_score":0.77036595,"about_ca_system_score_codex":0.00025014373,"about_ca_system_score_gemma":0.0004726415,"threshold_uncertainty_score":0.9993026},"labels":[],"label_agreement":null},{"id":"W2807502981","doi":"10.4230/lipics.isaac.2018.14","title":"An O(n^2 log^2 n) Time Algorithm for Minmax Regret Minsum Sink on Path Networks","year":2018,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Evacuation and Crowd Dynamics","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada","keywords":"Regret; Sink (geography); Path (computing); Aggregate (composite); Minimax; Computer science; Operations research; Mathematical economics; Economics; Mathematics; Computer network; Geography; Cartography; Machine learning; Materials science","score_opus":0.010641403169443642,"score_gpt":0.24689880755193852,"score_spread":0.23625740438249487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807502981","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036701646,0.00012910835,0.93658155,0.000105913634,0.0055170166,0.0044484977,0.009565423,0.0013879559,0.005562884],"genre_scores_gemma":[0.2988234,0.00093387556,0.5392111,0.006588127,0.010146497,0.004781397,0.13066472,0.0024067173,0.0064441566],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959451,0.000042163654,0.0017186075,0.00053218467,0.0005631957,0.0011987614],"domain_scores_gemma":[0.9967103,0.00018051903,0.0005390158,0.0016061271,0.0005341504,0.00042987932],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0007556987,0.0010883859,0.0010281797,0.00040678048,0.00030846125,0.0006050199,0.0012341811,0.0013900123,0.00011288804],"category_scores_gemma":[0.000062497704,0.001092006,0.0005925967,0.00019039353,0.00015450732,0.0006324678,0.00032678546,0.001154892,0.0003259514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070056086,0.0015506385,0.0006160196,0.0073499614,0.0027318492,0.00002177186,0.013390523,0.34812805,0.00005569564,0.002457889,0.27395514,0.34904188],"study_design_scores_gemma":[0.0019015721,0.00048965827,0.00008534065,0.00047621285,0.00013724927,0.0000148284225,0.00022109447,0.9396974,0.00010365128,0.0006279932,0.055092506,0.0011525],"about_ca_topic_score_codex":0.000005280209,"about_ca_topic_score_gemma":0.000013508017,"teacher_disagreement_score":0.59156936,"about_ca_system_score_codex":0.00043465517,"about_ca_system_score_gemma":0.00010791278,"threshold_uncertainty_score":0.9999064},"labels":[],"label_agreement":null},{"id":"W2810174119","doi":"10.4230/lipics.approx-random.2018.46","title":"Satisfiability and Derandomization for Small Polynomial Threshold Circuits","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Satisfiability; Mathematics; Polynomial; Computer science; Algorithm; Discrete mathematics; Combinatorics","score_opus":0.017630096420032347,"score_gpt":0.24257035753034417,"score_spread":0.22494026111031182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2810174119","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29698578,0.000030994695,0.698628,0.00023404525,0.00084693695,0.0013742455,0.00013296759,0.00019759577,0.0015694038],"genre_scores_gemma":[0.9673737,0.0000108645045,0.031013569,0.00097307,0.00029986858,0.00016966062,0.000088152614,0.00002313823,0.000047973837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980929,0.00004076844,0.0007429793,0.0003420656,0.00020992511,0.00057138124],"domain_scores_gemma":[0.9982163,0.00032092983,0.00027896566,0.0006788391,0.00032381798,0.000181164],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011107419,0.00029871686,0.00037146802,0.00021661933,0.00060608995,0.0005320938,0.0007609683,0.00017733351,0.000011917179],"category_scores_gemma":[0.0001643732,0.00027320124,0.00021846316,0.00028950794,0.00024855233,0.0011720746,0.00028850854,0.0001596434,0.000015198508],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002295843,0.00087742944,0.04477056,0.0018912163,0.0006328666,0.0000024751237,0.042638212,0.00008866378,0.0008917892,0.49876627,0.011998254,0.39514643],"study_design_scores_gemma":[0.05979907,0.004598329,0.014518382,0.00052264496,0.00031852257,0.00019332844,0.0012455299,0.5740916,0.0131580625,0.1520152,0.17583714,0.0037022138],"about_ca_topic_score_codex":0.000006187348,"about_ca_topic_score_gemma":0.000033496366,"teacher_disagreement_score":0.6703879,"about_ca_system_score_codex":0.00004485928,"about_ca_system_score_gemma":0.00005604315,"threshold_uncertainty_score":0.99997205},"labels":[],"label_agreement":null},{"id":"W2810396831","doi":"10.4230/lipics.aofa.2018.4","title":"Bootstrap Percolation and Galton-Watson Trees (Keynote Speakers)","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Percolation (cognitive psychology); Mathematics; Statistics; Watson; Econometrics; Computer science; Artificial intelligence; Psychology","score_opus":0.06048173084340924,"score_gpt":0.3462339176110378,"score_spread":0.28575218676762854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2810396831","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16805053,0.000048286165,0.82268566,0.00028250657,0.0007377174,0.001293514,0.0006615597,0.00023292324,0.0060073286],"genre_scores_gemma":[0.9154006,0.000038147347,0.0828293,0.00051960733,0.00045635737,0.00008646511,0.00015005615,0.00007890047,0.0004405697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974497,0.000024205014,0.0010339123,0.0002970402,0.00048464778,0.0007104887],"domain_scores_gemma":[0.99796015,0.00050808553,0.0003811208,0.00046257113,0.0004098445,0.0002782251],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052059034,0.00042060524,0.0005191766,0.00017274982,0.00042580417,0.00026497315,0.00033156204,0.00026689735,0.00015920575],"category_scores_gemma":[0.00085965946,0.00036594464,0.00013672914,0.0002088339,0.00022064621,0.00067068083,0.00016989256,0.00030773506,0.00011484729],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011024091,0.0007945443,0.0015118758,0.0037110054,0.000492606,0.000013147023,0.030283654,0.0000085278825,0.0005754784,0.8775727,0.01950226,0.06443178],"study_design_scores_gemma":[0.010478299,0.0035586471,0.002332003,0.0010527404,0.00061853766,0.00030884246,0.007792451,0.35249484,0.0032622388,0.5461988,0.06946278,0.0024398763],"about_ca_topic_score_codex":0.000011552286,"about_ca_topic_score_gemma":0.00007186665,"teacher_disagreement_score":0.7473501,"about_ca_system_score_codex":0.00008569638,"about_ca_system_score_gemma":0.000064388245,"threshold_uncertainty_score":0.99987924},"labels":[],"label_agreement":null},{"id":"W2810486625","doi":"10.4230/lipics.sea.2018.6","title":"Speeding up Dualization in the Fredman-Khachiyan Algorithm B","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Algorithm","score_opus":0.021613850467479278,"score_gpt":0.2850080168253123,"score_spread":0.263394166357833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2810486625","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0130179,0.00003917052,0.9791477,0.000504517,0.0021134603,0.00082460855,0.0001803161,0.00017528287,0.0039970684],"genre_scores_gemma":[0.5390047,0.000115156734,0.44970918,0.006502718,0.0022449489,0.00023784697,0.0014247401,0.000096348194,0.00066434604],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997381,0.00006719657,0.0008906518,0.00032051545,0.00066227675,0.0006784017],"domain_scores_gemma":[0.99811786,0.00014038135,0.00033994275,0.0010329497,0.00024962786,0.0001192633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010818208,0.00031935316,0.00029442486,0.00028767958,0.0005404801,0.00080994796,0.002130718,0.00016632922,0.000027095128],"category_scores_gemma":[0.000084233696,0.00022846009,0.00012536287,0.0006517808,0.00013200876,0.0028956286,0.000673662,0.0003371551,0.00017040479],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096094795,0.0008830253,0.005311253,0.00039345954,0.00015122604,0.000028656033,0.115205385,0.00013801572,0.0001403403,0.11955343,0.10223181,0.6558673],"study_design_scores_gemma":[0.0020467464,0.00030806244,0.0017417922,0.000160249,0.000014215133,0.000088433175,0.0017040434,0.8025403,0.0006059547,0.0032488129,0.18704759,0.00049382425],"about_ca_topic_score_codex":0.000049552003,"about_ca_topic_score_gemma":0.000026763737,"teacher_disagreement_score":0.80240226,"about_ca_system_score_codex":0.00008212264,"about_ca_system_score_gemma":0.000058527647,"threshold_uncertainty_score":0.93163323},"labels":[],"label_agreement":null},{"id":"W2810740386","doi":"10.4230/lites-v005-i001-a001","title":"Risk-Aware Scheduling of Dual Criticality Job Systems Using Demand Distributions","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Criticality; Computer science; Exploit; Probabilistic logic; Scheduling (production processes); Job scheduler; Distributed computing; Mathematical optimization; Artificial intelligence; Mathematics; Computer network","score_opus":0.025800413825419095,"score_gpt":0.29354077942873463,"score_spread":0.26774036560331554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2810740386","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3530807,0.000054387776,0.6434814,0.0000564106,0.0012559849,0.0007533077,0.0006288084,0.00017170294,0.00051733997],"genre_scores_gemma":[0.91395533,0.000008685249,0.08531024,0.00005229495,0.0004641454,0.00004696255,0.00010270457,0.00003512571,0.00002447771],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99521357,0.00020155594,0.0022184204,0.00046144324,0.0008386718,0.0010663588],"domain_scores_gemma":[0.99537957,0.00036829122,0.0010377438,0.0014429569,0.0013946313,0.0003768317],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021670794,0.00047710803,0.0008086748,0.0002928286,0.0008665725,0.0008047318,0.0013084954,0.00033643004,0.000011403814],"category_scores_gemma":[0.0005958231,0.00044370195,0.00033791427,0.0006603915,0.00040505256,0.0027622695,0.00071837055,0.00047162417,0.000097537595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006071037,0.0030864635,0.26465216,0.019219667,0.0039093113,0.00008830275,0.06402962,0.031231787,0.00782542,0.5909418,0.0045970865,0.009811318],"study_design_scores_gemma":[0.0016538487,0.00025169164,0.0016664452,0.0006841714,0.00010556708,0.00020750018,0.0016640257,0.9876298,0.0033268007,0.0007351271,0.0014280287,0.00064699946],"about_ca_topic_score_codex":0.00025854752,"about_ca_topic_score_gemma":0.000017962668,"teacher_disagreement_score":0.956398,"about_ca_system_score_codex":0.00025848724,"about_ca_system_score_gemma":0.00024144174,"threshold_uncertainty_score":0.99980146},"labels":[],"label_agreement":null},{"id":"W2811181433","doi":"10.4230/lipics.concur.2018.33","title":"Automatic Analysis of Expected Termination Time for Population Protocols","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":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fonds de recherche du Québec – Nature et technologies; Grantová Agentura České Republiky; Alexander von Humboldt-Stiftung","keywords":"Computation; Computer science; Protocol (science); Population; Parametric statistics; Upper and lower bounds; Function (biology); Distributed computing; Algorithm; Theoretical computer science; Mathematics","score_opus":0.01829018276171908,"score_gpt":0.3099208662115419,"score_spread":0.29163068344982285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2811181433","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09901052,0.000014289349,0.86455846,0.00008435658,0.00080273446,0.029442528,0.005031343,0.0004465568,0.0006091838],"genre_scores_gemma":[0.7885363,0.0000034676602,0.15690601,0.00020560595,0.00038017676,0.033478573,0.019856302,0.000099260644,0.00053428736],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953669,0.00007600259,0.0026123347,0.00055480027,0.0007760862,0.00061389635],"domain_scores_gemma":[0.9939209,0.00017330442,0.002730403,0.0017590373,0.001264357,0.00015194826],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010428159,0.0005780295,0.0014376591,0.0010011131,0.00023849968,0.0006497825,0.0019503315,0.00059525657,0.000035690427],"category_scores_gemma":[0.00020027366,0.00054164283,0.00087594346,0.0010064961,0.00008133345,0.0011825631,0.0007381495,0.00029769808,0.00003113983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014165904,0.009398299,0.07123213,0.09757529,0.03796397,0.000019168021,0.112806335,0.0361665,0.0010729063,0.054858066,0.09887523,0.4786155],"study_design_scores_gemma":[0.0014003033,0.00023177182,0.008527592,0.0008373899,0.00040688025,0.000004053128,0.00006571079,0.98211193,0.00025698688,0.0009007123,0.0046624867,0.0005941791],"about_ca_topic_score_codex":0.000037035312,"about_ca_topic_score_gemma":0.000014702059,"teacher_disagreement_score":0.94594544,"about_ca_system_score_codex":0.00024059594,"about_ca_system_score_gemma":0.00015232564,"threshold_uncertainty_score":0.9997035},"labels":[],"label_agreement":null},{"id":"W2811461449","doi":"10.4230/lipics.fun.2018.27","title":"The complexity of speedrunning video games","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Treewidth; Parameterized complexity; Boosting (machine learning); Bounded function; Computer science; Routing (electronic design automation); Time complexity; Exponential time hypothesis; Knapsack problem; Combinatorics; Theoretical computer science; Discrete mathematics; Mathematics; Mathematical optimization; Artificial intelligence; Pathwidth; Graph; Algorithm","score_opus":0.05888925186306259,"score_gpt":0.3089636948358681,"score_spread":0.2500744429728055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2811461449","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12870894,0.0001117797,0.8466733,0.0021262753,0.0035121504,0.001227473,0.00011254411,0.00035015983,0.017177358],"genre_scores_gemma":[0.9535795,0.00002720321,0.044938195,0.0006812437,0.0003644668,0.000040262166,0.000017542572,0.000025781232,0.00032581665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969071,0.000051999017,0.0013586336,0.00026930543,0.0006225219,0.00079040066],"domain_scores_gemma":[0.99673134,0.00039920025,0.0006728241,0.0013124968,0.0007271806,0.0001569365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010947424,0.00031411173,0.00038933154,0.00016152582,0.0007776012,0.00051320257,0.0026767638,0.00013697057,0.000027351654],"category_scores_gemma":[0.00034825693,0.00022935595,0.0002510227,0.00047105664,0.0017857933,0.001488028,0.0008492303,0.0002967192,0.00029772692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020179694,0.00036033077,0.008016469,0.0003388435,0.00031555732,0.000003966651,0.049211264,0.0001214845,0.00063324376,0.6847667,0.02495835,0.23107201],"study_design_scores_gemma":[0.0011370286,0.0011221523,0.003013989,0.00036277744,0.00004856813,0.000079966616,0.006033766,0.39703527,0.10203226,0.096995875,0.3909893,0.0011490658],"about_ca_topic_score_codex":0.000049598613,"about_ca_topic_score_gemma":0.000089630325,"teacher_disagreement_score":0.8248705,"about_ca_system_score_codex":0.00008029223,"about_ca_system_score_gemma":0.0001031453,"threshold_uncertainty_score":0.9352864},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.031245055841411285,"score_gpt":0.29786935584384455,"score_spread":0.26662430000243326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883173799","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053995093,0.00003878482,0.9102887,0.00030631616,0.00070188905,0.0772612,0.0047120964,0.00015087964,0.0011405998],"genre_scores_gemma":[0.648883,0.000007200707,0.1328948,0.0011381999,0.00061833474,0.21294975,0.0026480258,0.00014651765,0.00071417884],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946342,0.0001096084,0.0026021022,0.00075921044,0.00092929456,0.00096555054],"domain_scores_gemma":[0.99267477,0.00037737162,0.0022836453,0.0031021908,0.001348596,0.00021342341],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019647642,0.0008101938,0.0016264267,0.00059089414,0.00044657814,0.0007599372,0.0037878118,0.0006719683,0.000010637095],"category_scores_gemma":[0.00011945998,0.0005829137,0.0014088332,0.0010163678,0.00036350059,0.0002300382,0.0018072153,0.0006723136,0.000010437178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024387687,0.0060730106,0.005043887,0.042367276,0.058967624,0.000015816611,0.062428482,0.6540467,0.00025795028,0.07826328,0.05320869,0.036888488],"study_design_scores_gemma":[0.0024749958,0.00019293813,0.00056229543,0.00026385422,0.0006940164,0.000016677326,0.0005808628,0.97372574,0.00021776951,0.0008214021,0.019760868,0.0006885634],"about_ca_topic_score_codex":0.00006621909,"about_ca_topic_score_gemma":0.000021590977,"teacher_disagreement_score":0.77739394,"about_ca_system_score_codex":0.00017660994,"about_ca_system_score_gemma":0.0003074133,"threshold_uncertainty_score":0.9996622},"labels":[],"label_agreement":null},{"id":"W2883962117","doi":"10.4230/lipics.mfcs.2018.37","title":"Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames","year":2018,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; University of California, Santa Barbara; National Science Foundation","keywords":"Diagonal; Combinatorics; Mathematics; Intersection (aeronautics); Line segment; Approximation algorithm; Logarithm; Dominating set; Line (geometry); Discrete mathematics; Geometry; Graph; Mathematical analysis","score_opus":0.028714842930334793,"score_gpt":0.3103756508637333,"score_spread":0.28166080793339854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883962117","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53516614,0.000081038044,0.4575018,0.00011203285,0.0011702355,0.0019515465,0.0004391862,0.00028626082,0.003291739],"genre_scores_gemma":[0.8169689,0.000061859144,0.18207021,0.00018159278,0.00012679838,0.00025082193,0.00021169025,0.00006599322,0.00006209918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996031,0.0001571646,0.0016126557,0.00063770666,0.00077595166,0.00078553945],"domain_scores_gemma":[0.99564886,0.00064628024,0.0014737918,0.001419604,0.00061754364,0.00019389644],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001965591,0.0006179474,0.0008425651,0.0009881092,0.0003794272,0.0005203562,0.001862723,0.00048276826,0.000007898208],"category_scores_gemma":[0.0006798402,0.00056832837,0.00034713573,0.00047866392,0.00048110975,0.0011593299,0.00293675,0.0012525395,0.000013927666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016511685,0.0013115854,0.011255654,0.025079198,0.0020250448,0.00002354907,0.15261462,0.0020353806,0.0012720308,0.41520858,0.0037313593,0.38379183],"study_design_scores_gemma":[0.004450203,0.0023792335,0.0006355352,0.005809991,0.00010068855,0.00014329422,0.0073321476,0.60583776,0.019805208,0.3490746,0.0022407945,0.002190538],"about_ca_topic_score_codex":0.000015743959,"about_ca_topic_score_gemma":0.000008236842,"teacher_disagreement_score":0.6038024,"about_ca_system_score_codex":0.0001654484,"about_ca_system_score_gemma":0.00009449399,"threshold_uncertainty_score":0.9996768},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; 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","score_opus":0.016150544061017826,"score_gpt":0.25383470341345854,"score_spread":0.23768415935244072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2886070095","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1993336,0.000048090693,0.79199946,0.0002472551,0.00345324,0.0011805961,0.00003370698,0.00028855665,0.0034154858],"genre_scores_gemma":[0.88182616,0.00003005136,0.113471135,0.0014465455,0.002073859,0.00022535637,0.00033091116,0.00006442813,0.0005315243],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969083,0.000025833768,0.0013397948,0.00034308553,0.0006340231,0.00074895745],"domain_scores_gemma":[0.9972535,0.00010545533,0.0007248181,0.0009997945,0.0007182109,0.00019822319],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007706095,0.00036583148,0.000417464,0.00035622765,0.00054305285,0.0005039303,0.0015586824,0.00021176337,0.000008550465],"category_scores_gemma":[0.000045783458,0.00033356278,0.00023060087,0.00059228274,0.00017017503,0.0019580016,0.00052652124,0.0003247593,0.00022198685],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045477462,0.002444369,0.027884088,0.0032666568,0.0011141641,0.0000110771625,0.20522304,0.00046947366,0.004036024,0.09926071,0.20196034,0.4538753],"study_design_scores_gemma":[0.0027705396,0.00076407864,0.0023484717,0.00022845749,0.0000594032,0.00007836509,0.0014639236,0.3339971,0.021468716,0.0054765847,0.6303306,0.001013766],"about_ca_topic_score_codex":0.00007753885,"about_ca_topic_score_gemma":0.000042454416,"teacher_disagreement_score":0.6824926,"about_ca_system_score_codex":0.00012925317,"about_ca_system_score_gemma":0.00014917455,"threshold_uncertainty_score":0.99991167},"labels":[],"label_agreement":null},{"id":"W2886378351","doi":"10.4230/dagrep.8.2.101","title":"Data Consistency in Distributed Systems: Algorithms, Programs, and Databases (Dagstuhl Seminar 18091)","year":2018,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Agence Nationale de la Recherche","keywords":"Computer science; Consistency (knowledge bases); Database; Distributed database; Algorithm; Artificial intelligence","score_opus":0.06080402614862889,"score_gpt":0.29857990828721304,"score_spread":0.23777588213858414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2886378351","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16687232,0.003524313,0.78351486,0.0012050358,0.008095642,0.010789415,0.021136276,0.0018272179,0.003034918],"genre_scores_gemma":[0.7576394,0.0007237288,0.18333137,0.0010453529,0.0019066639,0.0011688959,0.052933626,0.00029462646,0.00095632026],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99335754,0.00018871673,0.0024935293,0.0015187707,0.0010284279,0.0014129907],"domain_scores_gemma":[0.9921563,0.00031232883,0.0013301999,0.0053623356,0.0004423617,0.00039642208],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0024692332,0.0010591913,0.0013384694,0.00058928,0.0005211655,0.001978326,0.0056843576,0.00048226764,0.0000038784196],"category_scores_gemma":[0.00024225246,0.00096939766,0.00021153832,0.0005979912,0.0004463732,0.0005178504,0.02020165,0.0012196981,0.000049632043],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006087114,0.009819404,0.09253083,0.06330933,0.0062249023,0.0009766639,0.047802426,0.016471589,0.000011746939,0.043672934,0.33982995,0.3787415],"study_design_scores_gemma":[0.0018266976,0.00022021028,0.00073933013,0.0027126025,0.00011896769,0.00013136397,0.0015161374,0.77606195,0.0000068322115,0.00029194905,0.2152178,0.0011561556],"about_ca_topic_score_codex":0.00037860128,"about_ca_topic_score_gemma":0.00011484745,"teacher_disagreement_score":0.7595904,"about_ca_system_score_codex":0.00028779215,"about_ca_system_score_gemma":0.0002878541,"threshold_uncertainty_score":0.99969536},"labels":[],"label_agreement":null},{"id":"W2886751042","doi":"10.4230/lipics.fscd.2018.19","title":"Index-Stratified Types","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Rings, Modules, and Algebras","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Index (typography); Mathematics; Statistics; Computer science","score_opus":0.03283214050205933,"score_gpt":0.290830328016197,"score_spread":0.25799818751413767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2886751042","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9146741,0.000035279365,0.033526152,0.00030167878,0.0016866716,0.0014082569,0.0002841909,0.00049798744,0.047585662],"genre_scores_gemma":[0.97346294,0.000017416734,0.021892976,0.0009252469,0.00095031306,0.000100158526,0.00016078095,0.0001024348,0.0023877516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969937,0.00003328319,0.0012544673,0.00029786487,0.0005415618,0.00087910827],"domain_scores_gemma":[0.99768406,0.00023387001,0.0005099414,0.0009048339,0.00042308756,0.0002442155],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062653044,0.0004829577,0.0005807025,0.00024586968,0.0004507494,0.00032080087,0.0007286198,0.0003257185,0.00030189878],"category_scores_gemma":[0.00035384137,0.00041798802,0.00027963024,0.00025951362,0.0003227326,0.00091742194,0.00021880426,0.00040544634,0.00072522514],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013499435,0.0027850342,0.036028806,0.0056084273,0.0020053869,0.00003137751,0.0769588,0.000024709474,0.001632627,0.5508282,0.2802249,0.042521793],"study_design_scores_gemma":[0.013947025,0.0018563545,0.0066275797,0.0011168777,0.00048074836,0.00027905803,0.009019245,0.019713352,0.03550618,0.36559644,0.5418357,0.0040214118],"about_ca_topic_score_codex":0.00001868634,"about_ca_topic_score_gemma":0.00008705185,"teacher_disagreement_score":0.26161084,"about_ca_system_score_codex":0.0000967322,"about_ca_system_score_gemma":0.00011307199,"threshold_uncertainty_score":0.9998272},"labels":[],"label_agreement":null},{"id":"W2888797620","doi":"10.4230/lipics.wabi.2018.20","title":"PRINCE: Accurate Approximation of the Copy Number of Tandem Repeats","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institutes of Health Research; Genome Canada; Alfred P. Sloan Foundation","keywords":"Tandem repeat; Multiple Loci VNTR Analysis; Variable number tandem repeat; Genome; Biology; Genetics; Computational biology; Minisatellite; Sequence (biology); Computer science; Microsatellite; Gene","score_opus":0.012398138104129285,"score_gpt":0.27078499430584807,"score_spread":0.2583868562017188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888797620","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9896901,0.000053765187,0.0027420714,0.000057547557,0.00038734003,0.0005682466,0.0002532822,0.0000042455995,0.006243401],"genre_scores_gemma":[0.9961022,0.000078162346,0.0031384386,0.00016589648,0.00014336946,0.00003166112,0.00008631511,0.000018770439,0.00023516772],"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998718,0.000024120189,0.0006741275,0.00014643847,0.00018483895,0.00025246592],"domain_scores_gemma":[0.9984549,0.000018614846,0.00052729575,0.00054400973,0.0004115593,0.000043577234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002748027,0.00018129632,0.00024368298,0.00002775939,0.0001405219,0.00001983369,0.0003889724,0.00014781533,0.000013008197],"category_scores_gemma":[0.0000918909,0.00013220444,0.00017714634,0.000105600804,0.0002774029,0.0000065549416,0.00030260728,0.00007653703,0.0000081671715],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008493241,0.0007130614,0.71747386,0.0015414829,0.0014255432,4.2215544e-7,0.012459963,0.00017734799,0.23891874,0.008416038,0.009534,0.008490201],"study_design_scores_gemma":[0.0032678745,0.00066334446,0.037461855,0.00015443814,0.00011774548,0.000034822504,0.0012172125,0.0012354965,0.8823768,0.0016455244,0.07129108,0.00053378433],"about_ca_topic_score_codex":0.000006863196,"about_ca_topic_score_gemma":0.000014059661,"teacher_disagreement_score":0.68001205,"about_ca_system_score_codex":0.000014367542,"about_ca_system_score_gemma":0.0000612969,"threshold_uncertainty_score":0.53911406},"labels":[],"label_agreement":null},{"id":"W2888982113","doi":"10.4230/lipics.giscience.2018.47","title":"OpenPOI: An Open Place of Interest Platform (Short Paper)","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science","score_opus":0.0560757865532742,"score_gpt":0.309528021035456,"score_spread":0.2534522344821818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888982113","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85409,0.00004294776,0.10328912,0.00077688927,0.0020561595,0.0027140682,0.0004108721,0.00037720086,0.036242787],"genre_scores_gemma":[0.9485127,0.000014404663,0.045135383,0.00541981,0.00029058527,0.00010136347,0.0003197063,0.00005229237,0.00015380491],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99674976,0.00004729356,0.0013679229,0.0005010527,0.00046904906,0.00086491444],"domain_scores_gemma":[0.9965467,0.00014842208,0.00048512776,0.0019311969,0.00056283636,0.00032571866],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00084009033,0.00050043897,0.0006449237,0.00032084744,0.0004414432,0.0009318675,0.0068748076,0.0002423604,0.00009277363],"category_scores_gemma":[0.000027522969,0.00041702396,0.00016775216,0.0006446662,0.00019747687,0.006979261,0.0030807273,0.00038579374,0.00015444522],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027694441,0.004369608,0.015067315,0.0034800712,0.0016410752,0.00004117378,0.2474764,0.00029480978,0.006274041,0.43125066,0.016705275,0.27063012],"study_design_scores_gemma":[0.010088523,0.007977544,0.0050592967,0.0012443733,0.00016444238,0.00034881892,0.011109694,0.15271306,0.06369157,0.011527952,0.7329811,0.0030936415],"about_ca_topic_score_codex":0.00023029481,"about_ca_topic_score_gemma":0.0016938428,"teacher_disagreement_score":0.7162758,"about_ca_system_score_codex":0.00007369898,"about_ca_system_score_gemma":0.0001603153,"threshold_uncertainty_score":0.99982816},"labels":[],"label_agreement":null},{"id":"W2895552009","doi":"10.4230/lipics.icalp.2020.21","title":"Counting Homomorphisms in Plain Exponential Time","year":2018,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Homomorphism; Exponential function; Mathematics; Exponential growth; Computer science; Discrete mathematics; Mathematical analysis","score_opus":0.020173281068611455,"score_gpt":0.28427927199375524,"score_spread":0.2641059909251438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2895552009","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32257304,0.00021603692,0.65920955,0.0003673159,0.003264588,0.0046889423,0.0012184839,0.0008213384,0.007640714],"genre_scores_gemma":[0.79198784,0.00018365154,0.19889206,0.001381409,0.001350448,0.0014656007,0.00272098,0.0003460814,0.0016719229],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99346054,0.00018922103,0.0021460948,0.0009585219,0.0013866063,0.0018590285],"domain_scores_gemma":[0.99492997,0.000413134,0.0010671915,0.0025926777,0.0006384967,0.00035851687],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0028428559,0.0009246439,0.0011250069,0.0012856814,0.0004479655,0.001254997,0.0054160594,0.00082421734,0.00010032547],"category_scores_gemma":[0.00029175307,0.00094224414,0.0005110247,0.00074288715,0.00048665793,0.0022487862,0.0064425524,0.0020588948,0.00095995684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0051630763,0.009743549,0.042904608,0.026379326,0.004877905,0.0011733639,0.14944912,0.021441046,0.0030834537,0.4270992,0.0909349,0.21775046],"study_design_scores_gemma":[0.0083099445,0.0007253939,0.0009865832,0.002292058,0.0000685366,0.0001983654,0.0006578491,0.80208474,0.003765622,0.12310842,0.054118846,0.003683626],"about_ca_topic_score_codex":0.000019725752,"about_ca_topic_score_gemma":0.00002152964,"teacher_disagreement_score":0.7806437,"about_ca_system_score_codex":0.00048991555,"about_ca_system_score_gemma":0.00037820422,"threshold_uncertainty_score":0.99996513},"labels":[],"label_agreement":null},{"id":"W290526480","doi":"10.4230/dagsemproc.06111.10","title":"Incremental branching programs","year":2006,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Grantová Agentura České Republiky; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; McGill University; Fonds Québécois de la Recherche sur la Nature et les Technologies; National Science Foundation","keywords":"Nondeterministic algorithm; Branching (polymer chemistry); Computation; Computer science; Exponential function; Mathematics; Discrete mathematics; Combinatorics; Algorithm","score_opus":0.008540348256302814,"score_gpt":0.21953475216317944,"score_spread":0.21099440390687663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W290526480","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49153945,0.000094241565,0.49055183,0.00034290963,0.0012400832,0.001372917,0.00011352448,0.0009953976,0.013749644],"genre_scores_gemma":[0.9396037,0.0000058759188,0.058441114,0.00094613,0.00026808842,0.0001212632,0.0003233387,0.000037459115,0.0002530384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99724877,0.00003577311,0.0009833485,0.00031640698,0.0005421258,0.0008735677],"domain_scores_gemma":[0.9984441,0.000083829604,0.0003659265,0.0008357233,0.000120064935,0.00015038921],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00067611504,0.00038427647,0.00036532248,0.00020768841,0.00042436252,0.0009131877,0.0015329021,0.00016079692,0.00002354036],"category_scores_gemma":[0.000022008699,0.0003407928,0.00026134966,0.00037064607,0.00010363565,0.0025473763,0.0005638435,0.00030472194,0.00018659278],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012412968,0.0020022166,0.028963927,0.0010637525,0.00030262306,0.000037869675,0.01116725,0.0002818095,0.0017057885,0.5435732,0.02295429,0.3878231],"study_design_scores_gemma":[0.013389774,0.001229244,0.010769395,0.00079289946,0.00010318834,0.0005665177,0.0025238814,0.51537305,0.015559581,0.057600204,0.3784251,0.003667166],"about_ca_topic_score_codex":0.00007375868,"about_ca_topic_score_gemma":0.00002452375,"teacher_disagreement_score":0.51509124,"about_ca_system_score_codex":0.00011671766,"about_ca_system_score_gemma":0.000050030525,"threshold_uncertainty_score":0.9999044},"labels":[],"label_agreement":null},{"id":"W2907125844","doi":"10.4230/lipics.icdt.2019.9","title":"Categorical Range Reporting with Frequencies","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Range (aeronautics); Categorical variable; Computer science; Machine learning; Engineering","score_opus":0.018562575614069335,"score_gpt":0.2422777644464392,"score_spread":0.22371518883236985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907125844","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16732347,0.000052900792,0.7886494,0.000905273,0.0017215176,0.0021103644,0.00012299587,0.0007309771,0.038383096],"genre_scores_gemma":[0.85652816,0.000024016115,0.13752623,0.0016835143,0.00022352625,0.00014880137,0.0004726133,0.00005860235,0.0033345309],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967575,0.00002039414,0.0013980079,0.0003828371,0.00066200725,0.00077927444],"domain_scores_gemma":[0.99710786,0.00008237623,0.0011739205,0.0012500319,0.00021812612,0.00016771015],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009151532,0.00035386244,0.00046564222,0.0002349288,0.00023063962,0.000837523,0.0015721795,0.0001133772,0.000039537037],"category_scores_gemma":[0.00009534711,0.0002689418,0.00016519948,0.00048366011,0.000072700335,0.0040370496,0.0006428292,0.0003128779,0.00045190565],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003192567,0.0013013631,0.24955152,0.0039216625,0.0012795872,0.00035763648,0.029793631,0.00072852976,0.00024581273,0.5067168,0.05202903,0.15375516],"study_design_scores_gemma":[0.011759307,0.0018996568,0.013760084,0.00045750246,0.00015509523,0.0006643461,0.0042941268,0.4171916,0.0014571977,0.0064485283,0.5385594,0.0033531734],"about_ca_topic_score_codex":0.000032242326,"about_ca_topic_score_gemma":0.000010280724,"teacher_disagreement_score":0.6892047,"about_ca_system_score_codex":0.000095905416,"about_ca_system_score_gemma":0.000073738054,"threshold_uncertainty_score":0.9999763},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Chordal graph; Computer science; Interval graph; Theoretical computer science; Graph; 1-planar graph","score_opus":0.04590123781032047,"score_gpt":0.34013356367956615,"score_spread":0.2942323258692457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907584067","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044144876,0.000066784174,0.9470496,0.00040256124,0.0014596283,0.0022738092,0.0020199618,0.0003966698,0.002186069],"genre_scores_gemma":[0.631029,0.000034961886,0.364508,0.0015495803,0.00063794595,0.00026396813,0.001484542,0.00009976924,0.0003922052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99611974,0.00006205912,0.0010261404,0.0006778766,0.00074256334,0.0013716446],"domain_scores_gemma":[0.9947093,0.000428997,0.0003958362,0.0034096316,0.00070376095,0.00035248155],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013679987,0.00048827747,0.0005046902,0.00050014164,0.00083654013,0.0006958632,0.0063028615,0.00022505187,0.000042819902],"category_scores_gemma":[0.00042579215,0.00042003402,0.00024484185,0.00072108663,0.00047534684,0.004124384,0.002236145,0.0004231177,0.000110286084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073357753,0.0003467774,0.0043910863,0.00083382614,0.0004962752,0.0000074034037,0.0062612426,0.0000540809,0.0003833162,0.84390324,0.043265697,0.099323496],"study_design_scores_gemma":[0.0077810828,0.0017880924,0.0019135796,0.00013353146,0.000065104614,0.00015091833,0.0008132577,0.21754622,0.006908959,0.31740987,0.44383082,0.0016585768],"about_ca_topic_score_codex":0.000010640536,"about_ca_topic_score_gemma":0.00003784627,"teacher_disagreement_score":0.58688414,"about_ca_system_score_codex":0.00008293794,"about_ca_system_score_gemma":0.00015280352,"threshold_uncertainty_score":0.9998251},"labels":[],"label_agreement":null},{"id":"W2914939413","doi":"10.4230/lipics.icalp.2019.91","title":"Toward a Dichotomy for Approximation of $H$-coloring","year":2019,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"National Science Foundation","keywords":"Digraph; Combinatorics; Homomorphism; Mathematics; Approximation algorithm; Discrete mathematics; Time complexity; Arc (geometry); Graph","score_opus":0.04762587225070952,"score_gpt":0.31523348949259755,"score_spread":0.26760761724188803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914939413","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03807126,0.00008691051,0.95010775,0.00018416479,0.0015632734,0.006583131,0.0009698384,0.00025700993,0.0021766555],"genre_scores_gemma":[0.6375485,0.000078472505,0.35796747,0.00025749116,0.00021619696,0.0023964483,0.0010171789,0.000116262076,0.00040197198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953425,0.000073419375,0.0018594817,0.000667296,0.0009608775,0.0010964217],"domain_scores_gemma":[0.99455553,0.0005798378,0.0014493034,0.0021566595,0.0010326004,0.00022608665],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016854659,0.00066664675,0.001093869,0.0008105783,0.00021038142,0.00047687208,0.0037819173,0.00059711235,0.000009044586],"category_scores_gemma":[0.00036102813,0.0006409404,0.00073654094,0.00044215436,0.00018771311,0.0018504557,0.0030650268,0.0010006855,0.000048415444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001908976,0.0018322668,0.005275615,0.067259565,0.002281389,0.000010073655,0.05997079,0.031031927,0.0009491727,0.7227638,0.0050321417,0.101684324],"study_design_scores_gemma":[0.005935453,0.00080677494,0.00028394553,0.001394668,0.000098088836,0.000029000497,0.0009657293,0.8307624,0.010849966,0.12204349,0.025259485,0.0015710068],"about_ca_topic_score_codex":0.0000085343045,"about_ca_topic_score_gemma":0.0000020436955,"teacher_disagreement_score":0.7997305,"about_ca_system_score_codex":0.00027845084,"about_ca_system_score_gemma":0.0003489321,"threshold_uncertainty_score":0.99960417},"labels":[],"label_agreement":null},{"id":"W2916420924","doi":"10.4230/lipics.icalp.2019.78","title":"Towards Optimal Depth Reductions for Syntactically Multilinear Circuits","year":2019,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Department of Science and Technology, Ministry of Science and Technology, India; Tata Institute of Fundamental Research","keywords":"Exponent; Multilinear map; Combinatorics; Upper and lower bounds; Omega; Mathematics; Degree (music); Polynomial; Discrete mathematics; Mathematical analysis; Physics; Pure mathematics; Quantum mechanics","score_opus":0.043345682677481366,"score_gpt":0.3074808794513182,"score_spread":0.26413519677383684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2916420924","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008958111,0.00009621263,0.9708291,0.00094748684,0.008080494,0.004220867,0.0025045415,0.0006357767,0.0037274004],"genre_scores_gemma":[0.20000756,0.0001375002,0.7933145,0.0010981171,0.0011301418,0.0012861687,0.0020333515,0.00015908832,0.0008335721],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946288,0.00006697222,0.0019784793,0.0010035234,0.00091235107,0.0014099062],"domain_scores_gemma":[0.99448836,0.00043092572,0.0009805465,0.0026289485,0.0010421169,0.0004291061],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010265289,0.00097367127,0.0011757958,0.00063545775,0.0006592686,0.0015050392,0.004038143,0.0008806888,0.000029412377],"category_scores_gemma":[0.00040598525,0.00097534346,0.0012104354,0.00042364188,0.00025724253,0.0016998796,0.0031469283,0.001643554,0.0001504604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005756281,0.004842426,0.0011219409,0.018951176,0.0046576746,0.00003758767,0.039795406,0.047136504,0.00016098787,0.29578915,0.044386078,0.54254544],"study_design_scores_gemma":[0.0029015832,0.0004759328,0.0003467939,0.0006132704,0.00017032228,0.00013708089,0.0005789432,0.8945641,0.0008334947,0.008602835,0.089203745,0.0015719334],"about_ca_topic_score_codex":0.000035711586,"about_ca_topic_score_gemma":0.00001638556,"teacher_disagreement_score":0.84742755,"about_ca_system_score_codex":0.00031870016,"about_ca_system_score_gemma":0.000732039,"threshold_uncertainty_score":0.9995315},"labels":[],"label_agreement":null},{"id":"W2916806630","doi":"10.4230/lipics.icalp.2019.58","title":"Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation; National Science Foundation","keywords":"Boolean function; Conjecture; Mathematics; Product (mathematics); Generalization; Combinatorics; Discrete mathematics; Measure (data warehouse); Product measure; Argument (complex analysis); Function (biology); Computer science","score_opus":0.028998688564719703,"score_gpt":0.2460417792424528,"score_spread":0.21704309067773309,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2916806630","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92723036,0.00011730627,0.01052109,0.00024922815,0.0010963189,0.016014246,0.004380508,0.00017836122,0.040212587],"genre_scores_gemma":[0.9909868,0.00000670173,0.00089775096,0.00023822396,0.00024031436,0.0020786796,0.00046460994,0.00005263072,0.005034241],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976576,0.000027906653,0.0012599487,0.000381734,0.000085567124,0.00058722583],"domain_scores_gemma":[0.99833935,0.00013249164,0.00072631065,0.00054741243,0.00010880839,0.00014565008],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010196209,0.00032008905,0.0006130623,0.00030304413,0.00051741337,0.00037440174,0.00026308038,0.00015697407,0.00014075244],"category_scores_gemma":[0.00021716599,0.00034194934,0.00019868906,0.0003640228,0.000118061784,0.0010786506,0.00013733307,0.00038743133,0.00048264317],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061739906,0.0009965887,0.59758914,0.0036850856,0.00096910953,0.0000037496236,0.018487398,0.00023974117,0.00021016777,0.36314145,0.011818025,0.0022421852],"study_design_scores_gemma":[0.016343907,0.0017169288,0.10018156,0.0022518924,0.00012928211,0.00027756274,0.008021557,0.042910587,0.0014172925,0.058493465,0.76465714,0.0035988258],"about_ca_topic_score_codex":0.000023954966,"about_ca_topic_score_gemma":0.0000064910687,"teacher_disagreement_score":0.75283915,"about_ca_system_score_codex":0.00023647136,"about_ca_system_score_gemma":0.00006601113,"threshold_uncertainty_score":0.99990326},"labels":[],"label_agreement":null},{"id":"W2917055100","doi":"10.4230/dagsemproc.10061.1","title":"10061 Abstracts Collection – Circuits, Logic, and Games","year":2010,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Informatics; Section (typography); Work (physics); Research center; Center (category theory); Electronic circuit; Mathematics education; Electrical engineering; Engineering; Psychology; Political science","score_opus":0.012914686516707862,"score_gpt":0.2445793892799274,"score_spread":0.23166470276321954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2917055100","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5216658,0.000082302526,0.4543106,0.0015010871,0.00539169,0.002354779,0.00015030407,0.0009873345,0.013556103],"genre_scores_gemma":[0.91890806,0.000033934506,0.07919537,0.0010132989,0.00028815656,0.00011269018,0.00007844396,0.000035921883,0.00033410662],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968186,0.000042263335,0.0011646299,0.0005280855,0.0005754781,0.0008709138],"domain_scores_gemma":[0.99725413,0.00034396208,0.00048783957,0.0011278705,0.00042683457,0.0003593678],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001043364,0.0004756079,0.0005092753,0.00034404866,0.0005383118,0.0009881876,0.0013238896,0.00036123468,0.00004272483],"category_scores_gemma":[0.00030259654,0.00043333665,0.00020293593,0.00052138604,0.00024113867,0.0020906876,0.0007392199,0.0007837705,0.00012480047],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015985215,0.0029289473,0.036666635,0.0023228314,0.000595112,0.00006321787,0.040982854,0.00094881275,0.0033196763,0.1464961,0.025089953,0.740426],"study_design_scores_gemma":[0.009341513,0.0017214566,0.108931385,0.00018099077,0.00011385117,0.001565836,0.0014032662,0.5447116,0.0069984784,0.055749655,0.26591355,0.0033684226],"about_ca_topic_score_codex":0.000047889396,"about_ca_topic_score_gemma":0.000116137024,"teacher_disagreement_score":0.73705757,"about_ca_system_score_codex":0.000110030494,"about_ca_system_score_gemma":0.00014978023,"threshold_uncertainty_score":0.9998118},"labels":[],"label_agreement":null},{"id":"W2917061129","doi":"10.4230/lipics.ccc.2019.20","title":"Universality of EPR Pairs in Entanglement-Assisted Communication Complexity, and the Communication Cost of State Conversion","year":2019,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada; Government of Canada; Canadian Institute for Advanced Research; National Science Foundation","keywords":"Quantum entanglement; Quantum information science; Bipartite graph; LOCC; Communication complexity; Mathematics; Discrete mathematics; Quantum mechanics; Bounded function; Physics; Quantum","score_opus":0.03117126209909912,"score_gpt":0.27037406651477297,"score_spread":0.23920280441567385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2917061129","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5970869,0.00066491833,0.37634006,0.0030148553,0.0008250408,0.010003758,0.0024049184,0.00021889886,0.009440624],"genre_scores_gemma":[0.98460597,0.0010287315,0.012675954,0.00031538203,0.000003554679,0.00007373253,0.0012650589,0.000013929504,0.0000176837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996566,0.0003943663,0.0019382067,0.00020465473,0.0005725573,0.0003242294],"domain_scores_gemma":[0.9941482,0.0004962636,0.0023552917,0.002333094,0.0005845185,0.00008263326],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023947507,0.0003415188,0.0007518824,0.0005061452,0.00021156501,0.00020140671,0.0026855445,0.00023455375,0.00001507453],"category_scores_gemma":[0.000058830174,0.00028483712,0.00028330425,0.0004510092,0.0008800696,0.0011833399,0.003246856,0.000688162,0.0000075128646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00187943,0.0015569841,0.07762526,0.011543464,0.0010707092,9.10281e-7,0.18111016,0.0032959578,0.000031665477,0.6815731,0.004074884,0.03623751],"study_design_scores_gemma":[0.022305816,0.00025892592,0.038822696,0.0023427964,0.0001353863,0.000013481198,0.016170343,0.87854666,0.001040922,0.029526275,0.00983312,0.0010035741],"about_ca_topic_score_codex":0.00052172603,"about_ca_topic_score_gemma":0.00015317037,"teacher_disagreement_score":0.8752507,"about_ca_system_score_codex":0.00014766013,"about_ca_system_score_gemma":0.00013951337,"threshold_uncertainty_score":0.99996036},"labels":[],"label_agreement":null},{"id":"W2932277743","doi":"10.4230/lipics.stacs.2019.40","title":"A Characterization of Subshifts with Computable Language","year":2019,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Future Earth","funders":"","keywords":"Characterization (materials science); Computer science; Theoretical computer science","score_opus":0.00934227030477084,"score_gpt":0.23227065996252594,"score_spread":0.2229283896577551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2932277743","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37690297,0.000026835558,0.61879325,0.00013089132,0.00037928697,0.0015373717,0.0008475413,0.000209316,0.0011725093],"genre_scores_gemma":[0.95269555,0.000025948693,0.041292656,0.0003087558,0.000091806396,0.00023761512,0.004890076,0.00005548929,0.0004021331],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99749976,0.000030506008,0.0010298885,0.00041266883,0.00052448316,0.00050270004],"domain_scores_gemma":[0.9965836,0.00006979256,0.0011010536,0.0017841377,0.00033077915,0.00013065901],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032754315,0.00045242772,0.0006828611,0.00029248276,0.00013000741,0.00044818496,0.0018773057,0.0003217285,0.000015895455],"category_scores_gemma":[0.000012795191,0.00039595144,0.00022750256,0.00034662528,0.00008170563,0.0008787277,0.0013530621,0.00050134124,0.000101982914],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009907336,0.009276144,0.041657284,0.06320339,0.0054495824,0.00008057759,0.32455727,0.03556587,0.07391508,0.29534167,0.010023408,0.139939],"study_design_scores_gemma":[0.0034351465,0.00034454896,0.004791795,0.001190572,0.0001417602,0.000067309564,0.0005490652,0.93640566,0.025117869,0.0007010934,0.025735594,0.001519602],"about_ca_topic_score_codex":0.000033328797,"about_ca_topic_score_gemma":0.0000095372125,"teacher_disagreement_score":0.90083975,"about_ca_system_score_codex":0.000085568754,"about_ca_system_score_gemma":0.00023113089,"threshold_uncertainty_score":0.99984926},"labels":[],"label_agreement":null},{"id":"W2938806477","doi":"10.4230/lipics.icalp.2019.137","title":"Energy Consumption of Group Search on a Line","year":2019,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Université de Sherbrooke; Carleton University; Toronto Metropolitan University; Université du Québec en Outaouais","funders":"","keywords":"Robot; Bounded function; Line (geometry); Energy (signal processing); Computer science; Energy consumption; Constant (computer programming); Algorithm; Mathematics; Artificial intelligence; Engineering; Geometry; Electrical engineering","score_opus":0.050881177732604296,"score_gpt":0.30483765629693776,"score_spread":0.25395647856433345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2938806477","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00854307,0.00007129202,0.9819118,0.0006863113,0.0016209068,0.0016290534,0.00066611206,0.00023783481,0.004633651],"genre_scores_gemma":[0.8563878,0.0013550337,0.13060735,0.0051316926,0.00023260863,0.00042032142,0.003936964,0.00013588103,0.0017923604],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959717,0.00012434287,0.0015174937,0.0005304087,0.0010967866,0.0007592737],"domain_scores_gemma":[0.9963047,0.00025142246,0.0007645016,0.0017678335,0.0006625253,0.0002489974],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010691724,0.0005302877,0.00076517445,0.00072302815,0.00016159711,0.00049736066,0.0022672329,0.0005134427,0.00007245725],"category_scores_gemma":[0.000059920512,0.0004885305,0.0004023895,0.000292863,0.00014868943,0.00081768335,0.0022432061,0.0009740186,0.00019379586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080805615,0.0034765732,0.0044988026,0.014150484,0.0013283967,0.000015396903,0.021759002,0.4345577,0.00020666183,0.36036682,0.032253694,0.12657839],"study_design_scores_gemma":[0.0022090592,0.0006699414,0.000112342,0.0006808784,0.000018064316,0.00001042658,0.000083421495,0.96698433,0.0009681861,0.0008926356,0.026810052,0.0005606852],"about_ca_topic_score_codex":0.00004166994,"about_ca_topic_score_gemma":0.000009759972,"teacher_disagreement_score":0.8513044,"about_ca_system_score_codex":0.00018233489,"about_ca_system_score_gemma":0.00024787744,"threshold_uncertainty_score":0.99975663},"labels":[],"label_agreement":null},{"id":"W2940319467","doi":"10.4230/lipics.opodis.2017.31","title":"Shape formation by programmable particles","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Modular Robots and Swarm Intelligence","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Computer science; Grid; Node (physics); Isosceles triangle; Constructive; Hexagonal tiling; Constant (computer programming); Characterization (materials science); Topology (electrical circuits); Distributed computing; Geometry; Process (computing); Physics; Mathematics; Combinatorics; Optics","score_opus":0.014285508763020888,"score_gpt":0.2336301135995201,"score_spread":0.2193446048364992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2940319467","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53187686,0.000227635,0.45597315,0.0001464422,0.001158115,0.0015728822,0.0003849277,0.00097788,0.007682105],"genre_scores_gemma":[0.9891668,0.00009012591,0.009400503,0.00030720548,0.00020449475,0.00016948034,0.00039314295,0.000063923275,0.00020432018],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997992,0.000011565517,0.0008136693,0.00014273202,0.00030314442,0.00073690247],"domain_scores_gemma":[0.9990493,0.000031524003,0.00012667976,0.00041002323,0.00020014003,0.00018232827],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000293513,0.00030660312,0.0002738844,0.00010712174,0.00025657064,0.00029461738,0.0003932194,0.00016716371,0.00016124028],"category_scores_gemma":[0.000033221102,0.0002779048,0.00012415316,0.00021627227,0.00011823654,0.0013704404,0.00007570002,0.00020922217,0.0005814496],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021950653,0.00057285716,0.003333443,0.0028408691,0.0005253818,0.000005443596,0.023741797,0.0039424747,0.006166305,0.0077013746,0.21408972,0.7368608],"study_design_scores_gemma":[0.0006979136,0.00023112797,0.00005904782,0.00007538292,0.000024491943,0.000022410768,0.000506492,0.64382374,0.044957925,0.00038148867,0.30878356,0.00043643088],"about_ca_topic_score_codex":0.000008303323,"about_ca_topic_score_gemma":0.000018415712,"teacher_disagreement_score":0.7364244,"about_ca_system_score_codex":0.00009136453,"about_ca_system_score_gemma":0.000014096381,"threshold_uncertainty_score":0.99996734},"labels":[],"label_agreement":null},{"id":"W2940471369","doi":"10.4230/dagrep.8.10.127","title":"Data Physicalization (Dagstuhl Seminar 18441)","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Sports Science and Education","field":"Arts and Humanities","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Bauhaus-Universität Weimar; Monash University; University of Lethbridge; Julius-Maximilians-Universität Würzburg; Microsoft Research; Carnegie Mellon University; University of Minnesota","keywords":"Environmental science; Computer science","score_opus":0.054221553302701245,"score_gpt":0.28094446613120916,"score_spread":0.22672291282850793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2940471369","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88592327,0.00006760366,0.0019622694,0.0008656977,0.0064656744,0.0020760794,0.0022992322,0.0003493243,0.099990875],"genre_scores_gemma":[0.97595686,0.00003503992,0.0007736947,0.0017834529,0.0012383077,0.00006624772,0.0072633834,0.00005596417,0.0128270695],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977373,0.000015922837,0.0007817305,0.0003466663,0.00051103503,0.00060736143],"domain_scores_gemma":[0.99784386,0.000073953226,0.00039623585,0.0012469806,0.00029424272,0.00014475147],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000529953,0.00030803902,0.00034489503,0.00019530293,0.0004888589,0.0006803166,0.0010636841,0.00010440377,0.0014540498],"category_scores_gemma":[0.000056742658,0.00026314077,0.00012596516,0.00013508947,0.00021040841,0.0036235808,0.00028247503,0.00022050693,0.0018818643],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021168882,0.0016226982,0.02510404,0.001558534,0.0002974672,0.0000032541463,0.26834157,0.00031991035,0.00024582402,0.21849231,0.460245,0.023557682],"study_design_scores_gemma":[0.00084544544,0.00015317078,0.00061915116,0.00011664272,0.000049651408,0.000007258879,0.018770175,0.021436678,0.00013461719,0.00060418085,0.95681566,0.00044735672],"about_ca_topic_score_codex":0.00007483879,"about_ca_topic_score_gemma":0.00011143557,"teacher_disagreement_score":0.49657065,"about_ca_system_score_codex":0.00008441197,"about_ca_system_score_gemma":0.00011097924,"threshold_uncertainty_score":0.99998206},"labels":[],"label_agreement":null},{"id":"W2940923581","doi":"10.4230/lipics.mfcs.2017.24","title":"Better Complexity Bounds for Cost Register Automata","year":2017,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Register (sociolinguistics); Automaton; Register allocation; Theoretical computer science; Parallel computing; Programming language","score_opus":0.06230586614724938,"score_gpt":0.3169479117971421,"score_spread":0.25464204564989273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2940923581","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058506615,0.000036755144,0.91353786,0.005627137,0.0033519634,0.0030831767,0.0015079275,0.00082297367,0.013525616],"genre_scores_gemma":[0.7579199,0.000024588686,0.22684056,0.010227582,0.0008305914,0.0008485081,0.0009237446,0.00013279411,0.00225171],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966736,0.000035788784,0.001125181,0.00049666164,0.0005317186,0.0011370409],"domain_scores_gemma":[0.99471533,0.0002269773,0.0010013805,0.0034478833,0.0003158252,0.00029262932],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011607689,0.00052393007,0.0006405488,0.00019194266,0.0018855896,0.0031367375,0.00459558,0.00026429124,0.000030472595],"category_scores_gemma":[0.00021301549,0.00046278475,0.00044730073,0.00010562208,0.00048284905,0.004220845,0.0013834428,0.0003396907,0.00019747936],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037704693,0.0009905692,0.008425063,0.002028515,0.00060707785,0.000025103307,0.010824465,0.000025582758,0.00020506905,0.55599827,0.20385808,0.21663518],"study_design_scores_gemma":[0.006566211,0.00034534818,0.0062359553,0.00025210044,0.00005456874,0.000107305015,0.00024996136,0.30769938,0.001087946,0.036218055,0.6400448,0.0011383526],"about_ca_topic_score_codex":0.000029857523,"about_ca_topic_score_gemma":0.000032434727,"teacher_disagreement_score":0.6994133,"about_ca_system_score_codex":0.00014048215,"about_ca_system_score_gemma":0.000093787225,"threshold_uncertainty_score":0.9997824},"labels":[],"label_agreement":null},{"id":"W2942961654","doi":"10.4230/lipics.icalp.2019.35","title":"Query-To-Communication Lifting for BPP Using Inner Product","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Simons Institute for the Theory of Computing, University of California Berkeley; Israel Science Foundation","keywords":"Gadget; Mathematical proof; Computer science; Mathematics; Search engine indexing; Entropy (arrow of time); Product (mathematics); Theoretical computer science; Discrete mathematics; Combinatorics; Information retrieval","score_opus":0.02559971745356479,"score_gpt":0.2813312082238702,"score_spread":0.25573149077030544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2942961654","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24371348,0.00007997978,0.74795336,0.0010815692,0.0016662612,0.0032759095,0.00019570599,0.00034970997,0.0016840157],"genre_scores_gemma":[0.4554339,0.00000929173,0.54216605,0.0015431615,0.0001951044,0.00016693749,0.00014668217,0.000046466004,0.0002923964],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99730545,0.000047100148,0.0010180868,0.0004063606,0.0004270892,0.0007959101],"domain_scores_gemma":[0.9969767,0.00025386273,0.00044106087,0.0017578548,0.00038467319,0.00018586806],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001103189,0.00036143532,0.00043924194,0.0003934266,0.0005694631,0.00065889506,0.0021567615,0.0001318605,0.000013905304],"category_scores_gemma":[0.000185612,0.0003477712,0.00026714866,0.00067114655,0.00007145342,0.0022599215,0.0009649714,0.00034332668,0.00012884114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005329413,0.0018185788,0.025847578,0.0045768428,0.0009305395,0.0000043791924,0.083248675,0.009688656,0.0036102303,0.36793315,0.015449035,0.4863594],"study_design_scores_gemma":[0.0026322396,0.00035073297,0.0008334983,0.00044667494,0.000034373774,0.00005212511,0.0007674552,0.82365704,0.003546779,0.0071152123,0.15952934,0.0010345515],"about_ca_topic_score_codex":0.000031878142,"about_ca_topic_score_gemma":0.000015550135,"teacher_disagreement_score":0.81396836,"about_ca_system_score_codex":0.00013940758,"about_ca_system_score_gemma":0.00011218865,"threshold_uncertainty_score":0.9998974},"labels":[],"label_agreement":null},{"id":"W2946703759","doi":"10.4230/lipics.mfcs.2019.59","title":"Counting Homomorphisms Modulo a Prime Number","year":2019,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Homomorphism; Combinatorics; Modulo; Mathematics; Discrete mathematics; Graph homomorphism; Graph; Prime (order theory); Prime number; Graph power; Line graph","score_opus":0.022752544219782747,"score_gpt":0.29763978576484207,"score_spread":0.27488724154505934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946703759","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06374885,0.0001245216,0.9101964,0.00033985576,0.003409973,0.0042552836,0.0011197707,0.00083063834,0.015974687],"genre_scores_gemma":[0.7949005,0.000151123,0.19727051,0.0014446331,0.00054056145,0.0008972446,0.0014003514,0.00027037607,0.0031247414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99291116,0.00014647536,0.0020695317,0.0011028068,0.0017477559,0.0020222866],"domain_scores_gemma":[0.99248445,0.0004585241,0.0014252601,0.004106826,0.0010762722,0.00044863884],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0020209716,0.0011366532,0.001342409,0.00063235336,0.0005204119,0.0017263644,0.006259957,0.00094216835,0.000091062495],"category_scores_gemma":[0.00028228937,0.0011070276,0.0008212694,0.00066419144,0.00033217078,0.0027514715,0.0076777115,0.0027033864,0.0018565019],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010081573,0.0030745652,0.03448425,0.018692572,0.003814015,0.00019031501,0.039952196,0.026827889,0.0004552224,0.7425524,0.031218989,0.09772943],"study_design_scores_gemma":[0.0061496706,0.00038610623,0.0008727072,0.0017941938,0.0001238817,0.0003330486,0.0007494602,0.7533111,0.0027800205,0.13045482,0.099103846,0.003941153],"about_ca_topic_score_codex":0.000025474235,"about_ca_topic_score_gemma":0.000004929562,"teacher_disagreement_score":0.7311516,"about_ca_system_score_codex":0.0004978997,"about_ca_system_score_gemma":0.000552514,"threshold_uncertainty_score":0.99959743},"labels":[],"label_agreement":null},{"id":"W2946907515","doi":"10.4230/lipics.itcs.2020.26","title":"On Local Testability in the Non-Signaling Setting","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Experimental Learning in Engineering","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Interchain Stiftung; Ethereum Foundation; Achievement Rewards for College Scientists Foundation; National Science Foundation","keywords":"Testability; Computer science; Reliability engineering; Engineering","score_opus":0.008621963358760525,"score_gpt":0.218389583665734,"score_spread":0.20976762030697346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946907515","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85476947,0.00005621951,0.13535997,0.00029615744,0.00046620148,0.0011274747,0.00010471508,0.00053657306,0.0072831884],"genre_scores_gemma":[0.9936712,0.0000045901825,0.004933178,0.0009831411,0.00012773328,0.000108619824,0.000097613985,0.00006968593,0.0000042538063],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805886,0.000026917813,0.0007682833,0.00018012046,0.0003599988,0.0006058201],"domain_scores_gemma":[0.9989681,0.00042432384,0.00008245547,0.00035645175,0.00003696245,0.00013170447],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005071787,0.00035077467,0.0003097575,0.00010278068,0.00012866849,0.00014579293,0.00055514526,0.00014578356,0.000026542202],"category_scores_gemma":[0.00018878013,0.00029646026,0.00014243569,0.00032077456,0.00006405632,0.00043905576,0.00008892143,0.00081659015,0.00011576555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076257136,0.0001277614,0.0045494046,0.0016204068,0.000084823136,0.000014033612,0.05094038,0.93221205,0.0026359237,0.0010583395,0.0018994537,0.0047811344],"study_design_scores_gemma":[0.0015084937,0.00022942176,0.0008490927,0.00025170064,0.000014211687,0.000014437031,0.0076253815,0.97319186,0.007961653,0.000071343704,0.007759658,0.00052275084],"about_ca_topic_score_codex":0.0000050998287,"about_ca_topic_score_gemma":0.0000035029273,"teacher_disagreement_score":0.1389017,"about_ca_system_score_codex":0.00020965644,"about_ca_system_score_gemma":0.00001906479,"threshold_uncertainty_score":0.99994874},"labels":[],"label_agreement":null},{"id":"W2947194824","doi":"10.4230/oasics.ldk.2019.13","title":"A Proposal for a Two-Way Journey on Validating Locations in Unstructured and Structured Data","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Innovation Cluster (Canada)","funders":"","keywords":"Computer science; Unstructured data; Data science; Database; Data mining; Big data","score_opus":0.027119531376479898,"score_gpt":0.2921384102888953,"score_spread":0.26501887891241543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947194824","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1779382,0.000046228313,0.802901,0.0022773186,0.0027114777,0.0074784243,0.00348885,0.00034353125,0.0028149448],"genre_scores_gemma":[0.6320911,0.0000124564685,0.36267292,0.0010360384,0.00019884082,0.00014079128,0.003497468,0.0000485664,0.0003017806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976595,0.000033751934,0.00082311174,0.00048625702,0.00038818546,0.00060917565],"domain_scores_gemma":[0.99764425,0.0001524993,0.00037715782,0.0015732883,0.00012267526,0.00013016335],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007851934,0.0003283709,0.00037007406,0.00036477967,0.00022719044,0.0009885686,0.0021819968,0.00010230252,0.0000117064],"category_scores_gemma":[0.00012293672,0.0002803128,0.00006965824,0.00035972835,0.000059469945,0.0036249186,0.0011789693,0.00029059846,0.00002961292],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043446722,0.0006436133,0.014341561,0.0031520058,0.0005685544,0.000012150827,0.018460602,0.0020234608,0.0004317185,0.5775851,0.018697014,0.3636498],"study_design_scores_gemma":[0.0075395815,0.00036859632,0.0019397939,0.00025832327,0.00003674319,0.00003281202,0.0010502044,0.9527543,0.00057226146,0.009323875,0.0254301,0.00069340214],"about_ca_topic_score_codex":0.000017828115,"about_ca_topic_score_gemma":0.00006831244,"teacher_disagreement_score":0.95073086,"about_ca_system_score_codex":0.00006804948,"about_ca_system_score_gemma":0.00010823951,"threshold_uncertainty_score":0.9999649},"labels":[],"label_agreement":null},{"id":"W2947533077","doi":"10.4230/lipics.opodis.2019.28","title":"Optimal Register Construction in M&M Systems","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Embedded Systems Design Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Register (sociolinguistics); Computer science; Philosophy; Linguistics","score_opus":0.02723560032673622,"score_gpt":0.2527163328723498,"score_spread":0.22548073254561357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947533077","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028620057,0.00008245622,0.96015394,0.0008466995,0.0010649266,0.0019725454,0.00009224342,0.00083229266,0.0063348254],"genre_scores_gemma":[0.78523517,0.000020942955,0.21249546,0.0013978599,0.0002613756,0.00032848184,0.00007743028,0.00005170558,0.00013157251],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966812,0.00010024881,0.0015617027,0.00040956776,0.0005503181,0.0006969392],"domain_scores_gemma":[0.99792457,0.0001117691,0.00059335446,0.0008633871,0.0002395458,0.00026737456],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007183998,0.00039430716,0.00059987616,0.00030509537,0.00014324303,0.0006786953,0.0015398121,0.00029572635,0.0000067104656],"category_scores_gemma":[0.000114296905,0.0003768835,0.00018787211,0.00059552694,0.00011270355,0.0025131365,0.0004231047,0.00047204655,0.0001387677],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070513843,0.0008595607,0.03551458,0.010325909,0.0006427234,0.00023172163,0.13101359,0.008666128,0.0023481078,0.66306597,0.11104182,0.035584748],"study_design_scores_gemma":[0.004066767,0.0007877722,0.00025037513,0.0006449379,0.000025399542,0.00049269624,0.0033243573,0.8734273,0.003627267,0.0007156207,0.111311555,0.0013259792],"about_ca_topic_score_codex":0.0000308927,"about_ca_topic_score_gemma":0.0000044083836,"teacher_disagreement_score":0.8647612,"about_ca_system_score_codex":0.00019844747,"about_ca_system_score_gemma":0.0001003821,"threshold_uncertainty_score":0.99986833},"labels":[],"label_agreement":null},{"id":"W2947823345","doi":"10.4230/oasics.ldk.2019.22","title":"Opening Digitized Newspapers Corpora: Europeana’s Full-Text Data Interoperability Case","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Digital Humanities and Scholarship","field":"Arts and Humanities","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canarie","funders":"","keywords":"Newspaper; Interoperability; Metadata; Computer science; Cultural heritage; World Wide Web; Digitization; Digital library; Publishing; Political science; Linguistics; Media studies; Sociology","score_opus":0.08152154047678656,"score_gpt":0.2635114314603703,"score_spread":0.18198989098358376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947823345","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69096315,0.00004804362,0.00010851852,0.00015954251,0.0018954248,0.0013703833,0.0034507522,0.00027109263,0.30173308],"genre_scores_gemma":[0.9733545,0.000013960578,0.00040583414,0.0015760933,0.00046173696,0.000040172068,0.003012534,0.00010984907,0.021025315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99645555,0.00007400843,0.0015106155,0.0005455043,0.00049947604,0.00091483095],"domain_scores_gemma":[0.9966444,0.00020364828,0.00052237045,0.0019159646,0.0004147816,0.0002988795],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0009620041,0.000600421,0.0007203755,0.00020540324,0.0007918919,0.0040160404,0.0017601078,0.00012431433,0.0031350723],"category_scores_gemma":[0.00015922761,0.0004979403,0.00029489564,0.00007982057,0.0004467322,0.0070041176,0.0014169229,0.0006475874,0.0017152191],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029817142,0.0021388382,0.008795489,0.004554111,0.0020279796,0.00095581706,0.3148434,0.00012174159,0.00008281859,0.45516402,0.14045486,0.06787924],"study_design_scores_gemma":[0.0035409646,0.0005574117,0.00006325813,0.00025003575,0.00008608243,0.00054356735,0.04526268,0.0036544031,0.000014631975,0.0005398303,0.9445453,0.000941799],"about_ca_topic_score_codex":0.00019063598,"about_ca_topic_score_gemma":0.0011757972,"teacher_disagreement_score":0.8040905,"about_ca_system_score_codex":0.00012839834,"about_ca_system_score_gemma":0.00009011966,"threshold_uncertainty_score":0.9997472},"labels":[],"label_agreement":null},{"id":"W2953086575","doi":"10.4230/lipics.tqc.2014.48","title":"Bounds on Entanglement Assisted Source-channel Coding Via the Lovász Theta Number and Its Variants","year":2014,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Research Foundation Singapore; National Research Foundation; Ministry of Education, India; European Commission; Leverhulme Trust; British Heart Foundation; National Science Foundation","keywords":"Quantum entanglement; Combinatorics; Mathematics; Conjecture; Upper and lower bounds; Bounded function; Discrete mathematics; Integer (computer science); Quantum; Physics; Quantum mechanics; Computer science","score_opus":0.020022688094083026,"score_gpt":0.251291030914784,"score_spread":0.23126834282070097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953086575","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08918936,0.00003120377,0.89743495,0.0017362833,0.0019464857,0.0016809306,0.00010045257,0.00037211282,0.0075082313],"genre_scores_gemma":[0.98960257,0.000014145262,0.007369029,0.0021861123,0.000251339,0.00010575351,0.000059555554,0.000042973446,0.0003685069],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963364,0.00017656072,0.0011108732,0.00054140796,0.00085115846,0.0009836032],"domain_scores_gemma":[0.99697423,0.0006308343,0.00050731737,0.0013133007,0.00028957118,0.00028475423],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018390564,0.0005527399,0.00053237635,0.00016482487,0.0008453359,0.0010679992,0.0018445619,0.00019779483,0.00004327035],"category_scores_gemma":[0.0001877377,0.00039916908,0.00024295495,0.00039991408,0.00015255329,0.0011277614,0.0013445598,0.0004971243,0.00025786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060276827,0.005146644,0.016278405,0.0026757603,0.0019782586,0.00003843013,0.114618085,0.0042795134,0.0006286675,0.33220288,0.017319895,0.5042307],"study_design_scores_gemma":[0.002681334,0.0004356423,0.004622504,0.00012998926,0.000050332794,0.00020888232,0.0004525025,0.9497788,0.0005195316,0.006182592,0.03420136,0.0007365142],"about_ca_topic_score_codex":0.000020461726,"about_ca_topic_score_gemma":0.000016373451,"teacher_disagreement_score":0.9454993,"about_ca_system_score_codex":0.00019936451,"about_ca_system_score_gemma":0.0000530455,"threshold_uncertainty_score":0.999969},"labels":[],"label_agreement":null},{"id":"W2953106330","doi":"10.4230/lipics.cosit.2022.10","title":"Are Psychological Variables Relevant to Evaluating Geoinformatics Applications? The Case of Landmarks (Vision Paper)","year":2008,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Embodied and Extended Cognition","field":"Neuroscience","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Cognition; Computer science; Cognitive psychology; Psychology; Cognitive science; Neuroscience","score_opus":0.0729925459827801,"score_gpt":0.36786272467377973,"score_spread":0.29487017869099963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953106330","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6850201,0.00021679739,0.113979824,0.0025750285,0.0038121615,0.024098052,0.012380438,0.0010292819,0.1568883],"genre_scores_gemma":[0.971559,0.00055558764,0.01982892,0.005209658,0.00033298606,0.0016688544,0.0006361671,0.00008345197,0.00012538346],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953511,0.00018000096,0.00233706,0.000552929,0.00077670545,0.00080222875],"domain_scores_gemma":[0.99445903,0.0009243985,0.0022134515,0.0015806414,0.00056460215,0.0002578703],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013458256,0.0006536104,0.0008133573,0.0003209808,0.0008775043,0.00032438646,0.0012730183,0.00062279927,0.00004740082],"category_scores_gemma":[0.0014997738,0.00046152703,0.00041704014,0.0004226781,0.00029960228,0.0006331008,0.001296756,0.0013725726,0.00016217705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0046024066,0.008243869,0.0014167825,0.02760052,0.0009339699,0.00085866003,0.083928354,0.053382594,0.0036343194,0.18903324,0.07669646,0.54966885],"study_design_scores_gemma":[0.014410366,0.0037847843,0.00091020745,0.006903766,0.0011745333,0.0160016,0.022688778,0.55144745,0.009431334,0.25097653,0.11584243,0.006428195],"about_ca_topic_score_codex":0.000023076622,"about_ca_topic_score_gemma":0.000021751099,"teacher_disagreement_score":0.5432406,"about_ca_system_score_codex":0.00013846587,"about_ca_system_score_gemma":0.000094637486,"threshold_uncertainty_score":0.99978364},"labels":[],"label_agreement":null},{"id":"W2953195806","doi":"10.4230/lipics.approx-random.2016.28","title":"Towards a Constructive Version of Banaszczyk's Vector Balancing Theorem","year":2016,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek; National Science Foundation","keywords":"Mathematics; Constructive; Equivalence (formal languages); Regular polygon; Gaussian measure; Combinatorics; Norm (philosophy); Convex body; Distribution (mathematics); Sequence (biology); Discrete mathematics; Gaussian; Computer science; Mathematical analysis; Convex optimization; Geometry; Physics; Law","score_opus":0.0277196396158142,"score_gpt":0.2996892744997357,"score_spread":0.2719696348839215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953195806","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62098557,0.00046385528,0.25427333,0.0006820657,0.0064787674,0.0053356052,0.026020894,0.0006534522,0.08510647],"genre_scores_gemma":[0.9732239,0.00015756431,0.024298897,0.00020709401,0.0004821017,0.00020318199,0.0006863347,0.00013850699,0.0006024059],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951098,0.00008646232,0.002367537,0.00045251363,0.0010211417,0.0009625646],"domain_scores_gemma":[0.9940576,0.0010350731,0.0022249548,0.0011882824,0.001266055,0.00022803836],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014385964,0.0008525099,0.0016261541,0.00079165027,0.00023007221,0.00019281557,0.0011786802,0.000837024,0.0002609521],"category_scores_gemma":[0.0017533352,0.00065093226,0.0007841514,0.00037250607,0.00037717327,0.00067155284,0.0015109762,0.00086815,0.000055235047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015600786,0.0009256931,0.0026939006,0.04976458,0.0032151607,0.000017400882,0.04334949,0.00003995672,0.00016780577,0.8539796,0.020756809,0.023529522],"study_design_scores_gemma":[0.009361103,0.0008717053,0.00040792575,0.008594892,0.0008664303,0.00012461345,0.015315585,0.0040659667,0.01642477,0.91420716,0.026876519,0.002883299],"about_ca_topic_score_codex":0.00004267625,"about_ca_topic_score_gemma":0.000008992172,"teacher_disagreement_score":0.35223836,"about_ca_system_score_codex":0.00038938617,"about_ca_system_score_gemma":0.0005055298,"threshold_uncertainty_score":0.9995942},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.019399495376912178,"score_gpt":0.25821950570910135,"score_spread":0.23882001033218916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953924437","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05033607,0.00029774968,0.9099203,0.002122001,0.0077835685,0.010469559,0.0010457804,0.00118905,0.01683594],"genre_scores_gemma":[0.54316103,0.00016155497,0.44941044,0.0023012229,0.0006493226,0.0013780912,0.0014165079,0.00023278237,0.0012890716],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9923116,0.00016515447,0.0030216025,0.0013426236,0.0013270058,0.0018319974],"domain_scores_gemma":[0.9932819,0.0004554989,0.0013722994,0.0038312427,0.00065620104,0.0004028351],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":["metaepi_narrow","open_science"],"category_scores_codex":[0.0018755175,0.0012849175,0.0016810762,0.00095451495,0.00022994679,0.0014877411,0.0061465483,0.0010916943,0.000043344287],"category_scores_gemma":[0.00018773857,0.0012117065,0.00077869324,0.0007262045,0.00021023436,0.0018579531,0.009012859,0.0024085979,0.00052078656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007513085,0.012514163,0.14868662,0.041640148,0.00259204,0.0002974615,0.12226203,0.18026176,0.00006619046,0.14456594,0.060075447,0.2862869],"study_design_scores_gemma":[0.004434143,0.00048495719,0.0045741107,0.001069998,0.00005871136,0.000109219196,0.00034309225,0.9118727,0.00014212032,0.021157723,0.053408887,0.0023443354],"about_ca_topic_score_codex":0.00017952507,"about_ca_topic_score_gemma":0.0000873277,"teacher_disagreement_score":0.73161095,"about_ca_system_score_codex":0.00095464673,"about_ca_system_score_gemma":0.00068434194,"threshold_uncertainty_score":0.9999903},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.13311431167096552,"score_gpt":0.405443553735199,"score_spread":0.2723292420642335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962752375","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.113455415,0.000026789945,0.85543907,0.001457039,0.0032015787,0.006668034,0.009539324,0.00024954733,0.009963198],"genre_scores_gemma":[0.8148492,0.000028188286,0.16087522,0.010657941,0.00057737814,0.0009677893,0.0055806804,0.00013410694,0.0063295253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9938823,0.00008126233,0.002459985,0.00062306074,0.0017104453,0.001242948],"domain_scores_gemma":[0.99347526,0.002230088,0.0009820468,0.002380971,0.0006168958,0.0003147145],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.005921926,0.00048209395,0.00082062045,0.00044410568,0.00047378667,0.0010130348,0.0023514493,0.00021611726,0.0005734117],"category_scores_gemma":[0.0040482124,0.0003762308,0.0004944293,0.0006364348,0.00018366013,0.004297352,0.0012379814,0.0004202593,0.0022701533],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008097622,0.00066478545,0.0058162846,0.0015056729,0.0002473922,0.000002523675,0.0063571525,0.00030404388,0.0000070465812,0.8122048,0.08001695,0.09206363],"study_design_scores_gemma":[0.003096557,0.00047160877,0.00088852714,0.00021003364,0.0000737871,0.000011408166,0.005856572,0.027732087,0.00007626743,0.069838546,0.891052,0.00069258665],"about_ca_topic_score_codex":0.000018627738,"about_ca_topic_score_gemma":0.00005217171,"teacher_disagreement_score":0.8110351,"about_ca_system_score_codex":0.00013488728,"about_ca_system_score_gemma":0.00012330951,"threshold_uncertainty_score":0.999869},"labels":[],"label_agreement":null},{"id":"W2962803978","doi":"10.4230/lipics.isaac.2018.61","title":"Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity","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":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Deutsche Forschungsgemeinschaft; European Commission","keywords":"Rectangle; Set cover problem; Approximation algorithm; Logarithm; Line segment; Cover (algebra); Combinatorics; Mathematics; Computational geometry; Constant (computer programming); Boundary (topology); Set (abstract data type); Line (geometry); Plane (geometry); Discrete mathematics; Computer science; Algorithm; Geometry; Mathematical analysis","score_opus":0.026819945950279842,"score_gpt":0.2810604631147204,"score_spread":0.2542405171644405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962803978","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37586895,0.000074945645,0.61887306,0.0017692767,0.0010486051,0.0006902632,0.00021930161,0.0001623117,0.0012932695],"genre_scores_gemma":[0.93869174,0.000020263084,0.0579251,0.0017625527,0.00040555716,0.00006568479,0.0007269561,0.000020295874,0.00038186213],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979386,0.000079837315,0.000614586,0.00030256942,0.0005544056,0.00051005674],"domain_scores_gemma":[0.9983155,0.0001652822,0.00041145433,0.0005239449,0.00044133357,0.00014249008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006693158,0.00029898956,0.00025149793,0.0001633621,0.0009324819,0.00089475146,0.0010793338,0.000116036645,0.000021971182],"category_scores_gemma":[0.0000500176,0.00023513834,0.00014674998,0.00047816848,0.00019061184,0.0018285781,0.00037228424,0.00023432673,0.00007809798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012011571,0.005917203,0.0052717435,0.0019324207,0.0015020515,0.000018795448,0.09741903,0.005790742,0.10835266,0.08836241,0.3925349,0.29169688],"study_design_scores_gemma":[0.0032990507,0.0010361774,0.0007050028,0.0001558079,0.000053431202,0.00006534521,0.0010290563,0.72910684,0.13898446,0.0048469426,0.11978519,0.00093271426],"about_ca_topic_score_codex":0.000009151388,"about_ca_topic_score_gemma":0.000021249065,"teacher_disagreement_score":0.7233161,"about_ca_system_score_codex":0.00011617202,"about_ca_system_score_gemma":0.00007167639,"threshold_uncertainty_score":0.95886636},"labels":[],"label_agreement":null},{"id":"W2962832012","doi":"10.4230/lipics.fsttcs.2014.199","title":"Lift & Project Systems Performing on the Partial Vertex Cover Polytope","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":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Vertex cover; Vertex (graph theory); Approximation algorithm; Mathematics; Polytope; Lift (data mining); Cover (algebra); Relaxation (psychology); Theory of computation; Linear programming relaxation; Discrete mathematics; Graph; Linear programming; Computer science; Mathematical optimization; Algorithm","score_opus":0.036818026451760515,"score_gpt":0.2644570532543573,"score_spread":0.2276390268025968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962832012","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.141915,0.000076612916,0.81657964,0.0017226948,0.0067067402,0.0033973956,0.00030124438,0.00071930315,0.028581375],"genre_scores_gemma":[0.98487544,0.00002327193,0.010034484,0.0030505476,0.0005490531,0.0002960681,0.000121658624,0.00005049164,0.0009989787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968169,0.00012390716,0.00096259575,0.0003742654,0.0008022301,0.0009201425],"domain_scores_gemma":[0.99713355,0.0005800728,0.00040384682,0.0015135327,0.00020179425,0.0001671929],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014151735,0.00044973576,0.0004588788,0.00025637101,0.00093719736,0.0011498694,0.0021736878,0.000179515,0.000028239481],"category_scores_gemma":[0.00023870898,0.00031167318,0.00031439462,0.00048500515,0.00017217087,0.0013617073,0.00061858434,0.0005731788,0.00056780624],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020340446,0.0006829305,0.002205654,0.0008397796,0.00037678197,0.0000048686643,0.020562628,0.0013641049,0.00005810022,0.86528856,0.06186861,0.046544585],"study_design_scores_gemma":[0.00108737,0.00031199006,0.00016041005,0.00019506297,0.000018760516,0.000050366474,0.00030552686,0.5071486,0.00023072923,0.0010149868,0.48901272,0.00046348342],"about_ca_topic_score_codex":0.00005766367,"about_ca_topic_score_gemma":0.0000112225935,"teacher_disagreement_score":0.86427355,"about_ca_system_score_codex":0.00009534596,"about_ca_system_score_gemma":0.000106555024,"threshold_uncertainty_score":0.99993354},"labels":[],"label_agreement":null},{"id":"W2962981543","doi":"10.4230/lipics.approx-random.2017.18","title":"Approximating Unique Games Using Low Diameter Graph Decomposition","year":2017,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Minor (academic); Graph; Approximation algorithm; Discrete mathematics","score_opus":0.031841944923086854,"score_gpt":0.3105793707548013,"score_spread":0.27873742583171446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962981543","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1582344,0.000023286188,0.83732873,0.00023234256,0.0010897459,0.0007283602,0.00011901403,0.00024490998,0.0019991864],"genre_scores_gemma":[0.4957594,0.00001705956,0.50321835,0.00060692104,0.00016730433,0.00006825552,0.00008411692,0.000034399072,0.000044202356],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971889,0.00005426996,0.0010564885,0.00038873954,0.0004907754,0.0008208216],"domain_scores_gemma":[0.9965937,0.00015370504,0.00095536053,0.0018016739,0.00027510355,0.00022046143],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007965812,0.00043285458,0.00049411785,0.00035961103,0.0018325464,0.0021674274,0.0026027097,0.0002061454,0.000013027076],"category_scores_gemma":[0.00013353847,0.0004125692,0.00039088124,0.00022457709,0.00028218285,0.00423251,0.0010646152,0.00044242368,0.000031496565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029378358,0.0026683582,0.03784581,0.0052360133,0.0014082398,0.00009481721,0.04900193,0.003206762,0.0031726412,0.4046797,0.004351717,0.48804024],"study_design_scores_gemma":[0.0021469358,0.00017012033,0.002109928,0.00056300045,0.0000400123,0.00014392848,0.00034541928,0.956163,0.0048702154,0.028882567,0.0036182487,0.00094662956],"about_ca_topic_score_codex":0.00004766012,"about_ca_topic_score_gemma":0.00001652929,"teacher_disagreement_score":0.95295626,"about_ca_system_score_codex":0.00010172894,"about_ca_system_score_gemma":0.0000702415,"threshold_uncertainty_score":0.99983263},"labels":[],"label_agreement":null},{"id":"W2963042078","doi":"10.4230/lipics.itcs.2017.33","title":"Testing Submodularity and Other Properties of Valuation Functions","year":2017,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Property testing; Submodular set function; Bounding overwatch; Constant (computer programming); Mathematics; Valuation (finance); Discrete mathematics; Function (biology); Monotonic function; Constant function; Combinatorics; Computer science; Piecewise; Mathematical analysis","score_opus":0.062271835273430644,"score_gpt":0.2795524570611236,"score_spread":0.21728062178769295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963042078","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60703546,0.000051579198,0.38680488,0.00046089053,0.0006399605,0.0005802492,0.00006558356,0.00016313604,0.004198252],"genre_scores_gemma":[0.95875967,0.000001964922,0.040670805,0.00016132912,0.00008822389,0.000032590233,0.0000101482865,0.000013612135,0.000261665],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871314,0.00003278346,0.0004917639,0.0001773519,0.0002939814,0.00029095387],"domain_scores_gemma":[0.998307,0.00005869672,0.00051774463,0.00076597824,0.0002673793,0.000083189385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007630776,0.00017653855,0.00023405216,0.00010824564,0.0008138688,0.0005536785,0.0007175803,0.00008704697,0.000003607568],"category_scores_gemma":[0.00053307094,0.00014335447,0.000073793715,0.000085062995,0.00014537458,0.0013297683,0.00039001444,0.00021702943,0.00001636681],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010443527,0.0007085464,0.43228367,0.0024519388,0.00037446374,0.0000031430634,0.030130258,0.0011831904,0.004145803,0.037034087,0.0010070828,0.49057338],"study_design_scores_gemma":[0.0016998838,0.00025897572,0.041004784,0.00027411705,0.000032728734,0.000040102783,0.00032240764,0.9425348,0.0022308258,0.0015624574,0.009658029,0.00038090587],"about_ca_topic_score_codex":0.00014866774,"about_ca_topic_score_gemma":0.000012589548,"teacher_disagreement_score":0.9413516,"about_ca_system_score_codex":0.000022390937,"about_ca_system_score_gemma":0.000049695398,"threshold_uncertainty_score":0.62597036},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.020671696320407565,"score_gpt":0.2782466223932611,"score_spread":0.25757492607285354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963080927","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2931878,0.000037913775,0.70401007,0.00017221161,0.0011118556,0.0007134266,0.000041914733,0.00034146447,0.00038334733],"genre_scores_gemma":[0.9738179,0.00002177395,0.025338622,0.000082589,0.00010435051,0.000034271394,0.00007954765,0.000029222052,0.00049171934],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767697,0.00002745329,0.0008321583,0.0002672332,0.00062756,0.0005686154],"domain_scores_gemma":[0.9976265,0.00017018474,0.0002992257,0.00086611,0.00086908584,0.0001689291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005066544,0.0002621977,0.00045191793,0.00058637024,0.00008836441,0.00021243225,0.0012551179,0.00014246904,0.000037321573],"category_scores_gemma":[0.00067667634,0.0001892217,0.0002163194,0.0018544906,0.000108729735,0.0013171283,0.00039019872,0.00014804765,0.000105176485],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002790846,0.00046249578,0.89639604,0.00079900975,0.0015192273,0.000004601205,0.007904432,0.00031674578,0.00068266393,0.009516339,0.0045066713,0.077612676],"study_design_scores_gemma":[0.014706844,0.005919688,0.15434103,0.0023276987,0.001175905,0.00016478881,0.0013269753,0.6001508,0.033537276,0.0033420946,0.1782973,0.004709557],"about_ca_topic_score_codex":0.000017887127,"about_ca_topic_score_gemma":0.000026001731,"teacher_disagreement_score":0.742055,"about_ca_system_score_codex":0.00014301037,"about_ca_system_score_gemma":0.0001260367,"threshold_uncertainty_score":0.7716237},"labels":[],"label_agreement":null},{"id":"W2963143041","doi":"10.4230/lipics.tqc.2013.285","title":"Kitaev's Z_d-Codes Threshold Estimates","year":2013,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Intelligence Advanced Research Projects Activity; Compute Canada","keywords":"Decoding methods; Code (set theory); Error detection and correction; Noise (video); Quantum; Toric code; Mathematics; Algorithm; Discrete mathematics; Computer science; Physics; Quantum computer; Quantum mechanics; Artificial intelligence; Image (mathematics); Set (abstract data type)","score_opus":0.009502770313851085,"score_gpt":0.23302664153535987,"score_spread":0.2235238712215088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963143041","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38909578,0.00015502021,0.5979979,0.0019715412,0.0018120137,0.0016801658,0.00012814984,0.0011416805,0.0060177506],"genre_scores_gemma":[0.7443128,0.000018200433,0.2525212,0.0021390312,0.00030082048,0.00018112524,0.00013457284,0.000059811806,0.00033243845],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996841,0.000024325283,0.0010128899,0.0004270557,0.0005706609,0.0011240689],"domain_scores_gemma":[0.997574,0.00024718427,0.00037318864,0.0011638235,0.00030876134,0.00033305393],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00043012353,0.0005357498,0.00053555897,0.0002869315,0.0005594782,0.0013337467,0.0021345238,0.00021468026,0.000050677576],"category_scores_gemma":[0.00009081659,0.00043150192,0.00030473844,0.00042439366,0.00015241587,0.0019631737,0.00084681396,0.00053325034,0.0005889772],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011075631,0.002263289,0.028259745,0.0030465145,0.001311391,0.00006800119,0.05215424,0.03621248,0.001453023,0.21603304,0.1524761,0.5066114],"study_design_scores_gemma":[0.0011525993,0.00023600057,0.001841111,0.00014396338,0.000016585733,0.0001004025,0.00019310608,0.96631646,0.00098691,0.011885625,0.016478755,0.00064847694],"about_ca_topic_score_codex":0.000046821475,"about_ca_topic_score_gemma":0.0000050619533,"teacher_disagreement_score":0.93010396,"about_ca_system_score_codex":0.000066936875,"about_ca_system_score_gemma":0.0000752414,"threshold_uncertainty_score":0.9998137},"labels":[],"label_agreement":null},{"id":"W2963225498","doi":"10.4230/lipics.itcs.2019.54","title":"On the Communication Complexity of High-Dimensional Permutations","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Integer (computer science); Communication complexity; Combinatorics; Abelian group; Discrete mathematics; Extension (predicate logic); Mathematics; Variety (cybernetics); Group (periodic table); Computational complexity theory; Computer science; Theoretical computer science; Algorithm","score_opus":0.022459193858593098,"score_gpt":0.23265221125104732,"score_spread":0.21019301739245422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963225498","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9790958,0.000025481446,0.009068904,0.00021854014,0.0005380753,0.0006521766,0.00056651037,0.00015184555,0.009682625],"genre_scores_gemma":[0.99817544,0.0000044339595,0.0010596621,0.00024784368,0.000054082462,0.000066234395,0.00030292515,0.000025177731,0.00006417122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987513,0.0000524342,0.0006224979,0.00007433007,0.00024563406,0.00025384242],"domain_scores_gemma":[0.99865806,0.00025471766,0.00016052231,0.000649036,0.00021865798,0.00005898282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046286386,0.00018557477,0.00022989999,0.000117073854,0.00035642445,0.00005191149,0.00045221334,0.00009681458,0.00014497747],"category_scores_gemma":[0.000054098386,0.00013779393,0.00012309113,0.00019524264,0.0004263083,0.00026967438,0.00006945809,0.00021893297,0.00016085929],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010132287,0.00015960961,0.000286551,0.00031920095,0.00025043596,2.4324476e-7,0.010709493,0.0025538295,0.00028333926,0.9707324,0.013597055,0.0010065073],"study_design_scores_gemma":[0.006648645,0.0012129535,0.009905057,0.001232771,0.00021328051,0.00008906255,0.009446153,0.5976141,0.026593544,0.30742073,0.037930887,0.0016928075],"about_ca_topic_score_codex":0.000019469258,"about_ca_topic_score_gemma":0.00003312678,"teacher_disagreement_score":0.66331166,"about_ca_system_score_codex":0.000041832,"about_ca_system_score_gemma":0.000013832225,"threshold_uncertainty_score":0.56190735},"labels":[],"label_agreement":null},{"id":"W2963227782","doi":"10.4230/lipics.esa.2018.25","title":"Improved Time and Space Bounds for Dynamic Range Mode","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; University of Waterloo","funders":"","keywords":"Data structure; Linear space; Element (criminal law); Range query (database); Range (aeronautics); Computer science; Space (punctuation); Monte Carlo method; Algorithm; Binary logarithm; Theoretical computer science; Combinatorics; Mathematics; Information retrieval; Search engine; Web query classification; Statistics; Web search query","score_opus":0.007625279048213117,"score_gpt":0.25666534523955187,"score_spread":0.24904006619133875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963227782","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03835577,0.00006832401,0.9566785,0.00043513218,0.00083237916,0.0013331072,0.0010421847,0.00025817464,0.0009964128],"genre_scores_gemma":[0.35612285,0.00007141148,0.637121,0.0019323281,0.0005891021,0.0003465561,0.0011077821,0.00010672828,0.002602208],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979481,0.000019156436,0.0006426795,0.00037838717,0.00028938652,0.0007222659],"domain_scores_gemma":[0.9980727,0.00013237704,0.0003100687,0.0009314406,0.0003200156,0.00023339204],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042649018,0.00035689722,0.0003932176,0.00017920505,0.00057560514,0.0006965042,0.0010897105,0.00019160291,0.000014732176],"category_scores_gemma":[0.000064084306,0.0003019993,0.00014780079,0.00019742471,0.00018415079,0.0024042965,0.0007692547,0.00018720295,0.0000797181],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024319096,0.0022391796,0.0021243885,0.0040983595,0.0013284051,0.000017931057,0.07829666,0.00018010355,0.013185939,0.07100361,0.1401862,0.6849073],"study_design_scores_gemma":[0.002557492,0.0004979244,0.00014968343,0.000074228745,0.000020871708,0.00003152976,0.0000962943,0.93281406,0.000586033,0.0015441852,0.061220173,0.0004075343],"about_ca_topic_score_codex":0.000027378363,"about_ca_topic_score_gemma":0.000024821544,"teacher_disagreement_score":0.93263394,"about_ca_system_score_codex":0.00008195536,"about_ca_system_score_gemma":0.0000740556,"threshold_uncertainty_score":0.9999432},"labels":[],"label_agreement":null},{"id":"W2963282726","doi":"10.4230/lipics.icalp.2016.74","title":"Approximating Directed Steiner Problems via Tree Embedding","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":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Steiner tree problem; Combinatorics; Mathematics; Approximation algorithm; Directed acyclic graph; Feedback arc set; Directed graph; Discrete mathematics; Vertex (graph theory); Disjoint sets; Embedding; Covering problems; Graph; Computer science; Set (abstract data type); Line graph","score_opus":0.01862077904121224,"score_gpt":0.24849855334000945,"score_spread":0.22987777429879722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963282726","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019836044,0.000043302905,0.97084224,0.00061903725,0.0010730244,0.0010841242,0.00013554543,0.0010599173,0.0053067794],"genre_scores_gemma":[0.42872733,0.000032413885,0.56826735,0.0008410543,0.00038455456,0.00037881732,0.000116845935,0.00008975038,0.0011619139],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963069,0.00006004211,0.0014061109,0.00046344486,0.0006720675,0.0010914434],"domain_scores_gemma":[0.9972976,0.00034401505,0.0006039109,0.0011522238,0.0003316218,0.00027063242],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008410525,0.0005025861,0.0005517677,0.0003887255,0.00054934376,0.0005445779,0.0019079616,0.00020355398,0.000038699185],"category_scores_gemma":[0.00016707624,0.00035728363,0.00033377137,0.0006586308,0.00017045974,0.0028627366,0.0008526907,0.00032162122,0.00015455717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007793717,0.0007698891,0.003536782,0.0012351446,0.0004646193,0.000014363358,0.0166173,0.00033084545,0.0023221977,0.07467748,0.0057409764,0.8942125],"study_design_scores_gemma":[0.0045278366,0.00036954752,0.0004997989,0.00075131695,0.000035681733,0.00013289173,0.00028431995,0.9186072,0.0030156802,0.017505452,0.05302197,0.0012483228],"about_ca_topic_score_codex":0.000013533623,"about_ca_topic_score_gemma":0.000017830751,"teacher_disagreement_score":0.9182763,"about_ca_system_score_codex":0.00013977973,"about_ca_system_score_gemma":0.00006197705,"threshold_uncertainty_score":0.99988794},"labels":[],"label_agreement":null},{"id":"W2963306680","doi":"10.4230/lipics.icalp.2016.75","title":"Tight Analysis of a Multiple-Swap Heurstic for Budgeted Red-Blue Median","year":2016,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Swap (finance); Upper and lower bounds; Mathematics; Heuristic; Combinatorics; Matching (statistics); Approximation algorithm; Mathematical optimization; Computer science; Statistics; Economics","score_opus":0.02371906159291856,"score_gpt":0.24282902159203415,"score_spread":0.2191099599991156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963306680","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60262144,0.000043354547,0.37489554,0.00678871,0.0027896413,0.0045875423,0.0018305834,0.00048740418,0.0059557846],"genre_scores_gemma":[0.9935196,0.00002809598,0.0021081693,0.0013889329,0.00026538488,0.00031016517,0.0014200403,0.000044107615,0.0009155001],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970773,0.000010948049,0.0014607351,0.00031430135,0.00048750555,0.00064920995],"domain_scores_gemma":[0.99783295,0.00017330564,0.00050354615,0.0007155064,0.00071312673,0.00006156466],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00074117084,0.00037612813,0.0006431253,0.0011664269,0.00024607748,0.00015200047,0.00064894767,0.00015488293,0.00037159567],"category_scores_gemma":[0.0007286457,0.00028171405,0.0005660854,0.0011387599,0.00012468871,0.0016183137,0.00023237342,0.00009665662,0.00018904572],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0039682873,0.004147227,0.33844075,0.020837868,0.020691507,0.000009026362,0.010969259,0.009878901,0.0026252246,0.12037736,0.2431723,0.2248823],"study_design_scores_gemma":[0.0064407075,0.000100586585,0.016491054,0.00023136333,0.0020231064,7.0172246e-7,0.0015689692,0.32577103,0.00040689568,0.0008042527,0.6452256,0.00093574915],"about_ca_topic_score_codex":0.00021866315,"about_ca_topic_score_gemma":0.0012175064,"teacher_disagreement_score":0.40205327,"about_ca_system_score_codex":0.00009168336,"about_ca_system_score_gemma":0.000029764888,"threshold_uncertainty_score":0.9999635},"labels":[],"label_agreement":null},{"id":"W2963350132","doi":"10.4230/lipics.swat.2018.12","title":"Boundary Labeling for Rectangular Diagrams","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":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan; Carleton University","funders":"","keywords":"Boundary (topology); Rectangle; Combinatorics; Time complexity; Set (abstract data type); Mathematics; Graph; Polynomial; Computer science; Geometry; Discrete mathematics; Algorithm; Mathematical analysis; Programming language","score_opus":0.01661868606084442,"score_gpt":0.27406740591457013,"score_spread":0.2574487198537257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963350132","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053549133,0.00011010981,0.94097435,0.0005141031,0.0021665469,0.0010198336,0.00014537585,0.00023955967,0.0012809595],"genre_scores_gemma":[0.44507614,0.00003228201,0.5473714,0.0035801362,0.001630366,0.00034921814,0.00091714354,0.00005306763,0.0009902673],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99790627,0.000027062199,0.00076469476,0.00030575492,0.00039768,0.00059852266],"domain_scores_gemma":[0.99809194,0.00021369703,0.0002858851,0.0005664768,0.000674579,0.00016742699],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007704735,0.0002751527,0.00028131087,0.00025058188,0.0007306545,0.00066009257,0.0008526333,0.00015275882,0.000016342172],"category_scores_gemma":[0.00019417859,0.00026224117,0.00020898347,0.0004891387,0.000104272556,0.0015960382,0.00025533413,0.00016292221,0.00012236179],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044013088,0.0009588869,0.0018955627,0.0012746283,0.00062072184,0.000006897,0.026642527,0.001930452,0.002543761,0.22830006,0.0753253,0.66006106],"study_design_scores_gemma":[0.002387906,0.00071559567,0.00029118345,0.00008538079,0.000029555244,0.00004354837,0.00018199721,0.4816543,0.0065079243,0.012958179,0.49456945,0.0005749937],"about_ca_topic_score_codex":0.0000041546964,"about_ca_topic_score_gemma":0.0000140713055,"teacher_disagreement_score":0.65948606,"about_ca_system_score_codex":0.00009720123,"about_ca_system_score_gemma":0.00014409996,"threshold_uncertainty_score":0.99998295},"labels":[],"label_agreement":null},{"id":"W2963419150","doi":"10.4230/lipics.disc.2017.4","title":"Reuse, Don't Recycle: Transforming Lock-Free Algorithms That Throw Away Descriptors","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":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Global Affairs Canada; Israel Science Foundation; University of Toronto","keywords":"Computer science; Algorithm; Overhead (engineering); Reuse; Lock (firearm); Artificial intelligence; Machine learning; Programming language","score_opus":0.03523850705275347,"score_gpt":0.28125691022323734,"score_spread":0.24601840317048387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963419150","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011208747,0.00007082886,0.97224,0.0015056593,0.0015372514,0.0010681023,0.00012959824,0.0010549701,0.0111848675],"genre_scores_gemma":[0.3502434,0.00023280061,0.64666164,0.0011847754,0.00027775753,0.00015211738,0.00012364368,0.000083843646,0.0010400461],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965997,0.000050490053,0.0010780338,0.0004998401,0.0007293171,0.0010426678],"domain_scores_gemma":[0.99416685,0.00011845127,0.0008632563,0.004197513,0.00034547513,0.0003084306],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010679303,0.0005605217,0.00060089264,0.0003237427,0.0018767824,0.00205855,0.007564529,0.00035375124,0.000017262586],"category_scores_gemma":[0.00034810588,0.000512634,0.0003554442,0.0002241331,0.00023531946,0.004634153,0.0016621944,0.00055622536,0.000046730405],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042207533,0.0019048849,0.034783587,0.0025268244,0.001316563,0.000109353816,0.082925,0.0045279977,0.00040934875,0.08379642,0.3031086,0.48416933],"study_design_scores_gemma":[0.0068369377,0.000644365,0.0019307925,0.00078995933,0.0000811589,0.00021307911,0.0008022868,0.6807198,0.022491444,0.014104815,0.2690631,0.002322286],"about_ca_topic_score_codex":0.00007792841,"about_ca_topic_score_gemma":0.000028338784,"teacher_disagreement_score":0.6761918,"about_ca_system_score_codex":0.0001675625,"about_ca_system_score_gemma":0.00013053005,"threshold_uncertainty_score":0.99973255},"labels":[],"label_agreement":null},{"id":"W2963443829","doi":"10.4230/lipics.icalp.2017.32","title":"Improved Algorithms for MST and Metric-TSP Interdiction","year":2017,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Defense, Military, and Policy Studies","field":"Economics, Econometrics and Finance","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Interdiction; Knapsack problem; Approximation algorithm; Mathematics; Metric (unit); Continuous knapsack problem; Greedy algorithm; Combinatorics; Tree (set theory); Upper and lower bounds; Generalization; Multigraph; Mathematical optimization; Computer science; Algorithm","score_opus":0.05027572088194217,"score_gpt":0.28540757373975256,"score_spread":0.2351318528578104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963443829","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55200654,0.0051721693,0.24731939,0.006619567,0.016061986,0.009540069,0.030730667,0.00058730977,0.1319623],"genre_scores_gemma":[0.98643374,0.00065667916,0.008403457,0.00092810224,0.0006082006,0.00035304416,0.00029790922,0.000070250055,0.0022486255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977328,0.0000063396515,0.0011978229,0.00034110673,0.00006454964,0.0006573541],"domain_scores_gemma":[0.99793094,0.00012611406,0.0008600304,0.00076187844,0.00015427048,0.00016674075],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007743391,0.0003588039,0.0007063679,0.0004046188,0.0011123882,0.000489644,0.0005312332,0.00021609198,0.000022192067],"category_scores_gemma":[0.0005562015,0.0003674212,0.0003118318,0.00009756889,0.00021862597,0.0012160158,0.00030789198,0.00021818053,0.00009696231],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016420202,0.0015044346,0.28582978,0.006403627,0.0048980266,0.0000069626767,0.069972314,0.000048115286,0.000055920074,0.29036966,0.13568637,0.20358276],"study_design_scores_gemma":[0.008945089,0.0009943431,0.031962097,0.000111077505,0.00010385549,0.00003021355,0.0022901597,0.06915106,0.00022714901,0.019465888,0.8654282,0.0012908678],"about_ca_topic_score_codex":0.00029111296,"about_ca_topic_score_gemma":0.00009537797,"teacher_disagreement_score":0.7297418,"about_ca_system_score_codex":0.0001147174,"about_ca_system_score_gemma":0.000016525499,"threshold_uncertainty_score":0.99987775},"labels":[],"label_agreement":null},{"id":"W2963526330","doi":"10.4230/lipics.tqc.2019.2","title":"Quantum Distinguishing Complexity, Zero-Error Algorithms, and Statistical Zero Knowledge","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Bounded function; Zero (linguistics); Mathematics; Measure (data warehouse); Discrete mathematics; Function (biology); Upper and lower bounds; State (computer science); Boolean function; Algorithm; Combinatorics; Computer science","score_opus":0.03387183656975885,"score_gpt":0.2957106843187253,"score_spread":0.2618388477489665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963526330","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08179524,0.0001271163,0.90952516,0.00016892055,0.0014810893,0.0009789284,0.002074143,0.00032541287,0.0035240236],"genre_scores_gemma":[0.83992314,0.00002639055,0.15835443,0.0004886107,0.000113609276,0.000044846114,0.0009689749,0.000038406957,0.000041583484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968859,0.00007218241,0.0010551189,0.00052836223,0.0005130681,0.00094538],"domain_scores_gemma":[0.9974182,0.00047111587,0.00035733072,0.0010766876,0.00027482642,0.0004018263],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00085950625,0.00047782567,0.0006145989,0.00027008884,0.0004765337,0.001041318,0.0014596916,0.00020969429,0.0000375665],"category_scores_gemma":[0.00019083674,0.00044110458,0.0001818063,0.0004226703,0.00030535532,0.0022185605,0.0014128115,0.0005630223,0.00023149772],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006269093,0.0004420251,0.012620908,0.0009783288,0.00011471391,0.000009064243,0.009646056,0.000009088418,0.000024544588,0.9494124,0.010499995,0.016180202],"study_design_scores_gemma":[0.00544861,0.0007884934,0.015000123,0.00038840054,0.00007079683,0.00019650589,0.0010308112,0.6877196,0.00012019193,0.13384268,0.15372339,0.0016704417],"about_ca_topic_score_codex":0.000057406014,"about_ca_topic_score_gemma":0.000026153017,"teacher_disagreement_score":0.8155697,"about_ca_system_score_codex":0.00006891806,"about_ca_system_score_gemma":0.000085892665,"threshold_uncertainty_score":0.9999957},"labels":[],"label_agreement":null},{"id":"W2963530074","doi":"10.4230/lipics.isaac.2019.57","title":"On Approximate Range Mode and Range Selection","year":2019,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; University of Waterloo","funders":"","keywords":"Range (aeronautics); Rank (graph theory); Combinatorics; Space (punctuation); Constant (computer programming); Mathematics; Position (finance); Selection (genetic algorithm); Range query (database); Sequence (biology); Element (criminal law); Discrete mathematics; Computer science; Search engine; Web search query; Chemistry; Sargable","score_opus":0.01617894227685548,"score_gpt":0.26434331517425186,"score_spread":0.24816437289739637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963530074","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03883625,0.00014832403,0.9504794,0.00030712568,0.002659872,0.002619969,0.0014226541,0.0004768816,0.0030495136],"genre_scores_gemma":[0.63708776,0.00092109054,0.34771633,0.0049585877,0.001157329,0.0012969553,0.00479278,0.00031321915,0.001755968],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99659234,0.000065895656,0.001058669,0.00074375595,0.0007428952,0.0007964529],"domain_scores_gemma":[0.9969873,0.00017328314,0.00074653886,0.0015650198,0.00028099795,0.0002468598],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00060280063,0.0007337149,0.0008049615,0.0004247374,0.0003682803,0.0011298029,0.0017333912,0.0006362362,0.000016208478],"category_scores_gemma":[0.000059020367,0.0006313621,0.0002789494,0.00021461376,0.000079433594,0.0016896932,0.0028356458,0.0011621425,0.00012883316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028786766,0.00447645,0.016914465,0.032212604,0.0025629955,0.00006114504,0.0667672,0.05124743,0.00023061049,0.20533538,0.2533746,0.36393845],"study_design_scores_gemma":[0.0026065332,0.00027008416,0.00040454775,0.00061594776,0.00004246262,0.000042514057,0.00007537465,0.97081333,0.00015573896,0.005995882,0.018138614,0.00083894725],"about_ca_topic_score_codex":0.000057754958,"about_ca_topic_score_gemma":0.000009957352,"teacher_disagreement_score":0.9195659,"about_ca_system_score_codex":0.00018252926,"about_ca_system_score_gemma":0.00012928691,"threshold_uncertainty_score":0.99990714},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011409725992905883,"score_gpt":0.24882596063621948,"score_spread":0.2374162346433136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963552320","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3251092,0.00005490167,0.67170227,0.00041700748,0.00055163377,0.00041873218,0.00002706021,0.00008975146,0.0016294665],"genre_scores_gemma":[0.93860656,0.000017808601,0.0602665,0.0006690005,0.00016559611,0.000045520905,0.00011858756,0.0000107490505,0.00009965998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998537,0.00003294899,0.0005931574,0.0002198521,0.00027849528,0.00033855162],"domain_scores_gemma":[0.99898523,0.00010314957,0.00018745841,0.0002863012,0.00034247272,0.00009540268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058209547,0.00018075595,0.00018808809,0.0003089604,0.00025156324,0.00031347343,0.00031629537,0.00009161441,0.000010268749],"category_scores_gemma":[0.00011344836,0.0001758851,0.000045327477,0.00056727947,0.00009306995,0.0019311806,0.00022031435,0.00014422122,0.00003504476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034303556,0.0006363461,0.023582017,0.00093331205,0.00014798841,0.000010162416,0.062791154,0.0025770364,0.0011633766,0.61678475,0.005028485,0.28600234],"study_design_scores_gemma":[0.004033726,0.000957914,0.027432293,0.00033100936,0.000019019748,0.00016392303,0.0016368184,0.8812994,0.00609041,0.014322339,0.06270643,0.0010067153],"about_ca_topic_score_codex":0.000013039848,"about_ca_topic_score_gemma":0.00010775017,"teacher_disagreement_score":0.87872237,"about_ca_system_score_codex":0.00008244346,"about_ca_system_score_gemma":0.00010453472,"threshold_uncertainty_score":0.71723866},"labels":[],"label_agreement":null},{"id":"W2963643297","doi":"10.4230/lipics.itcs.2018.41","title":"Graph Clustering using Effective Resistance","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Conductance; Inverse; Graph; Connection (principal bundle); Degree (music); Discrete mathematics; Physics; Geometry","score_opus":0.012682103788339588,"score_gpt":0.28431961830362557,"score_spread":0.27163751451528595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963643297","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27648744,0.000028449336,0.7017124,0.00005099597,0.00041155922,0.0013404334,0.00027057072,0.00023870321,0.019459445],"genre_scores_gemma":[0.9662473,0.000002064439,0.03211435,0.00021616548,0.00076728617,0.00013516047,0.00019184317,0.000054674238,0.00027111892],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978886,0.000044274657,0.0008152122,0.00027062107,0.00029320706,0.00068805396],"domain_scores_gemma":[0.9983066,0.00010826723,0.00045116982,0.00064843294,0.00034396426,0.00014161077],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041187898,0.00038414507,0.00048621473,0.00025271648,0.00054789835,0.00024119548,0.0004978648,0.000096100855,0.00015331098],"category_scores_gemma":[0.0000126282575,0.0003697721,0.00037307965,0.00045721437,0.0002086737,0.0006903848,0.00030290984,0.00028553276,0.00005778465],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034115533,0.0034841327,0.34167552,0.003663728,0.010372057,0.000019122877,0.06446937,0.0033417111,0.006558312,0.18284094,0.13198474,0.24817882],"study_design_scores_gemma":[0.009177152,0.0009632172,0.005248343,0.0018442542,0.0009474688,0.000023996896,0.004880349,0.47389218,0.026018439,0.050765373,0.42202264,0.0042165895],"about_ca_topic_score_codex":0.00006518471,"about_ca_topic_score_gemma":0.000083936655,"teacher_disagreement_score":0.6897599,"about_ca_system_score_codex":0.000111088,"about_ca_system_score_gemma":0.00003428627,"threshold_uncertainty_score":0.9998754},"labels":[],"label_agreement":null},{"id":"W2963782874","doi":"10.4230/lipics.icalp.2017.55","title":"Further Approximations for Demand Matching: Matroid Constraints and Minor-Closed Graphs","year":2017,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Mathematics; Approximation algorithm; Combinatorics; Matroid; Discrete mathematics; Rounding; Polynomial-time approximation scheme; Vertex (graph theory); Linear programming relaxation; Knapsack problem; Graph; Mathematical optimization; Linear programming; Computer science","score_opus":0.023494034116332947,"score_gpt":0.2828776831977924,"score_spread":0.25938364908145944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963782874","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026432551,0.0000271505,0.9629241,0.0017029869,0.00044696213,0.0021193575,0.00039436066,0.00017860928,0.0057738987],"genre_scores_gemma":[0.703766,0.000044690732,0.29425135,0.0007520697,0.000060173083,0.00029806368,0.00016839479,0.000036528767,0.0006227394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794173,0.00003076818,0.0007398245,0.00030697873,0.00033689814,0.00064379274],"domain_scores_gemma":[0.9977462,0.00015160814,0.00052303856,0.0009964774,0.00031737445,0.00026525988],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00075389026,0.00031020283,0.00035997454,0.00022838044,0.0012612983,0.0017974522,0.0013186724,0.00016606746,0.000031117936],"category_scores_gemma":[0.00013818119,0.00027779196,0.0001809637,0.00009836003,0.0003594432,0.0024424708,0.00043260757,0.00021486092,0.000034043125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024039013,0.0009751459,0.012309903,0.0036400924,0.0007725988,0.0000088817405,0.06531122,0.0010390333,0.00050350645,0.80520165,0.012559566,0.09743803],"study_design_scores_gemma":[0.011680685,0.00048479537,0.004210563,0.00027820203,0.000066477005,0.00012948072,0.0021978368,0.87964803,0.0007160621,0.0688839,0.03039327,0.0013106666],"about_ca_topic_score_codex":0.000008087537,"about_ca_topic_score_gemma":0.000012962358,"teacher_disagreement_score":0.878609,"about_ca_system_score_codex":0.000035732057,"about_ca_system_score_gemma":0.00008043136,"threshold_uncertainty_score":0.9999674},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011468294227940972,"score_gpt":0.25449760773054636,"score_spread":0.2430293135026054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963859684","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019965589,0.000027981345,0.97435826,0.0011447017,0.0014948273,0.0015242725,0.00022723242,0.00030340877,0.00095371256],"genre_scores_gemma":[0.9448142,0.000035259738,0.050370388,0.002719619,0.00085706124,0.00035080742,0.0004683447,0.000041008065,0.00034330873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99712443,0.00002313613,0.0010817003,0.00043289826,0.0002988258,0.0010389882],"domain_scores_gemma":[0.99745804,0.00023458182,0.00048677277,0.001077773,0.0005004742,0.00024238507],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004712671,0.00037235222,0.00035334297,0.000119588134,0.0006808449,0.0004080257,0.0017079246,0.00019935827,0.0000055496853],"category_scores_gemma":[0.000051575804,0.0003361861,0.00024997687,0.00054283935,0.00017883877,0.0012641578,0.00036987642,0.00031861028,0.00005357325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018848712,0.0013852936,0.0024011526,0.00076383294,0.00065900886,0.000009692806,0.009468678,0.03457596,0.0009654356,0.39951035,0.2723282,0.27604753],"study_design_scores_gemma":[0.0015040234,0.00045670025,0.0001611249,0.000022451217,0.000017270104,0.000031751,0.00003098095,0.9319878,0.00037177242,0.0019861285,0.06303835,0.00039160988],"about_ca_topic_score_codex":0.000009222368,"about_ca_topic_score_gemma":0.000039548326,"teacher_disagreement_score":0.9248486,"about_ca_system_score_codex":0.000078545454,"about_ca_system_score_gemma":0.000046463072,"threshold_uncertainty_score":0.99990904},"labels":[],"label_agreement":null},{"id":"W2964036832","doi":"10.4230/lipics.wabi.2018.5","title":"Reconciling Multiple Genes Trees via Segmental Duplications and Losses","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Lambda; Tree (set theory); Gene duplication; Genome; Segmental duplication; Set (abstract data type); Time complexity; Gene; Combinatorics; Computer science; Biology; Computational complexity theory; Mathematics; Computational biology; Algorithm; Genetics; Gene family; Physics","score_opus":0.013491124354818928,"score_gpt":0.24583922955293272,"score_spread":0.2323481051981138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964036832","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9899737,0.00064920133,0.0069666477,0.00012211465,0.00032035308,0.0005573116,0.0004726965,0.000014842352,0.0009231015],"genre_scores_gemma":[0.98989505,0.00045795372,0.008078725,0.00048359757,0.00040459118,0.000099678706,0.00035772304,0.000031176907,0.00019151157],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987658,0.000013765576,0.00047883083,0.0002540164,0.00011003181,0.00037754799],"domain_scores_gemma":[0.99907833,0.000034041903,0.00017546205,0.00038801262,0.0002094122,0.000114733426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016584143,0.00025237157,0.00021862557,0.00006175916,0.0004054402,0.00009099273,0.0002348067,0.0001492803,0.0000109690245],"category_scores_gemma":[0.00005600748,0.00023478025,0.00011091543,0.000065474225,0.0002571989,0.000010571913,0.00026808522,0.00007499502,0.00002390009],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048410485,0.00045930548,0.33230022,0.00039844363,0.0010918068,0.000001412416,0.006189673,0.00009311047,0.5771234,0.0004619066,0.0070942487,0.074302346],"study_design_scores_gemma":[0.006186218,0.0019814153,0.047531866,0.000089562534,0.00018138008,0.00017663056,0.003964751,0.010429563,0.41201633,0.0005852503,0.5152869,0.0015701061],"about_ca_topic_score_codex":0.000019394212,"about_ca_topic_score_gemma":0.00022313201,"teacher_disagreement_score":0.50819266,"about_ca_system_score_codex":0.000020328698,"about_ca_system_score_gemma":0.000035353314,"threshold_uncertainty_score":0.9574061},"labels":[],"label_agreement":null},{"id":"W2964076874","doi":"10.4230/lipics.approx-random.2018.5","title":"Greedy Bipartite Matching in Random Type Poisson Arrival Model","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; University of Toronto","funders":"","keywords":"Poisson distribution; Bipartite graph; Matching (statistics); Combinatorics; Node (physics); Type (biology); Greedy algorithm; Random graph; Competitive analysis; Mathematics; Upper and lower bounds; Discrete mathematics; Computer science; Graph; Algorithm; Statistics; Physics","score_opus":0.031064202598069954,"score_gpt":0.28945299620023374,"score_spread":0.25838879360216377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964076874","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26359928,0.000046750578,0.72627443,0.0033533555,0.0013289368,0.0009714224,0.00018655756,0.00094528194,0.003293971],"genre_scores_gemma":[0.65728354,0.000038888076,0.34131786,0.00089258666,0.00012688538,0.00006902474,0.00011998982,0.000043854463,0.00010733271],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99655145,0.00004861574,0.0011915074,0.00048895605,0.00060579146,0.0011136553],"domain_scores_gemma":[0.99328023,0.00017524482,0.0004127116,0.0056724814,0.00029014246,0.0001692158],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0012201247,0.00044350044,0.0005409459,0.00055516884,0.0003145662,0.0005423771,0.016417142,0.00033184903,0.00001805983],"category_scores_gemma":[0.003145643,0.00040987937,0.00015298383,0.0008898483,0.00025021945,0.0034625528,0.02421342,0.00063013687,0.000322119],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031569772,0.0025564784,0.035939272,0.0026694962,0.0009912397,0.0001311896,0.061614256,0.006716173,0.004389154,0.13014643,0.63283604,0.1188533],"study_design_scores_gemma":[0.0034805322,0.00021667274,0.0002618756,0.00018651898,0.000012428323,0.000035093937,0.00021907098,0.90235996,0.0020024143,0.0831892,0.0074966503,0.00053958665],"about_ca_topic_score_codex":0.000056358305,"about_ca_topic_score_gemma":0.00008580929,"teacher_disagreement_score":0.8956438,"about_ca_system_score_codex":0.000204894,"about_ca_system_score_gemma":0.00014932241,"threshold_uncertainty_score":0.9998353},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Programming language; Software versioning; Compiler; Just-in-time compilation; JavaScript; Type inference; Python (programming language); Toolchain; Parallel computing; Software; Inference","score_opus":0.024121287491206147,"score_gpt":0.2821698156898441,"score_spread":0.258048528198638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964084063","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87254757,0.00018622351,0.120873496,0.0002125425,0.0014256048,0.0013677538,0.00006826236,0.0006288153,0.002689729],"genre_scores_gemma":[0.9434288,0.000020626736,0.055641852,0.00037073734,0.00016352425,0.000060833667,0.0000829284,0.00004572826,0.00018494905],"study_design_codex":"qualitative","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978035,0.000042277767,0.00047247898,0.00031697733,0.00063177024,0.00073300535],"domain_scores_gemma":[0.9978324,0.00056291744,0.00014267124,0.0007303396,0.00042121293,0.00031042035],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007858632,0.0003101846,0.00034662586,0.00018658601,0.0002283284,0.00037518246,0.00090453314,0.00017210889,0.000004654449],"category_scores_gemma":[0.0010487391,0.0002861889,0.00009552816,0.0005623261,0.00009897804,0.0018008986,0.0008598437,0.00043035235,0.000113953036],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020188892,0.0016382639,0.24888238,0.006338257,0.0025016405,0.00058148475,0.28916,0.015025391,0.0011901606,0.07112044,0.23633191,0.12521116],"study_design_scores_gemma":[0.0142211085,0.0027030383,0.01434905,0.0005038227,0.00008822608,0.001039604,0.0030381759,0.36002213,0.0069391117,0.0051502152,0.5895518,0.0023936986],"about_ca_topic_score_codex":0.000038769056,"about_ca_topic_score_gemma":0.0000039582465,"teacher_disagreement_score":0.3532199,"about_ca_system_score_codex":0.00021432921,"about_ca_system_score_gemma":0.000132651,"threshold_uncertainty_score":0.99995905},"labels":[],"label_agreement":null},{"id":"W2964110985","doi":"10.4230/lipics.stacs.2014.506","title":"Space-Efficient String Indexing for Wildcard Pattern Matching","year":2014,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Search engine indexing; Log-log plot; Binary logarithm; String (physics); Combinatorics; Alphabet; Mathematics; Pattern matching; Data structure; Matching (statistics); String searching algorithm; Computer science; Statistics; Information retrieval","score_opus":0.012138384331876216,"score_gpt":0.24470617512360687,"score_spread":0.23256779079173065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964110985","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06142811,0.000022620425,0.93459135,0.000295889,0.0013524353,0.0009889512,0.00024509567,0.0002888756,0.0007866835],"genre_scores_gemma":[0.84396726,0.000009035416,0.15395047,0.0010144183,0.00041907182,0.0001646965,0.00030984083,0.000056559074,0.000108633496],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970459,0.000038873895,0.00095440436,0.00043256272,0.00058709783,0.0009411699],"domain_scores_gemma":[0.99763423,0.00029437942,0.00049170566,0.0011007064,0.00022226789,0.00025672666],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009904244,0.0004227393,0.00047241728,0.00026475862,0.00064897607,0.00086703204,0.0016143259,0.00018811684,0.000006494549],"category_scores_gemma":[0.00009196045,0.00036999336,0.00027335194,0.00023752547,0.000052991385,0.001559658,0.0010335571,0.00035670554,0.000053929907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015180725,0.00075998635,0.0050891526,0.002197051,0.00032472963,0.0000074639283,0.026981896,0.021073185,0.0004276072,0.12821755,0.010062394,0.80470717],"study_design_scores_gemma":[0.0023470973,0.00019744624,0.0004447778,0.00030571915,0.000019770398,0.000024784385,0.0004113867,0.91249985,0.0008283866,0.0016763468,0.080674425,0.0005700057],"about_ca_topic_score_codex":0.000031686912,"about_ca_topic_score_gemma":0.0000063942916,"teacher_disagreement_score":0.8914267,"about_ca_system_score_codex":0.000117544645,"about_ca_system_score_gemma":0.000055157972,"threshold_uncertainty_score":0.9998752},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.013139787585957508,"score_gpt":0.27598739435984493,"score_spread":0.2628476067738874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964334818","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23635943,0.00000693278,0.75931764,0.00045072514,0.0005656066,0.0005327106,0.0002268415,0.00007765274,0.0024624693],"genre_scores_gemma":[0.9613677,0.000011793705,0.037639916,0.00046174935,0.00005336833,0.00005773566,0.000120882854,0.000011198411,0.00027562867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99805236,0.000036942267,0.00083703786,0.00027159753,0.00047198663,0.00033007096],"domain_scores_gemma":[0.9979041,0.00043719515,0.00036490208,0.0007893513,0.00037508385,0.00012935225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005095562,0.00020414537,0.0002573629,0.00034876956,0.00018916845,0.00010230219,0.0007055845,0.00009784882,0.000025612026],"category_scores_gemma":[0.0001898495,0.00014923,0.00019674854,0.00048803652,0.00008024809,0.001247325,0.0001315832,0.00010736971,0.00009042201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037664457,0.0015665467,0.013495621,0.00062393973,0.00038469964,0.0000061138066,0.0086745685,0.0029880835,0.0070020393,0.77343464,0.030400874,0.1610462],"study_design_scores_gemma":[0.022128932,0.0042191087,0.11346473,0.0011118053,0.00014564987,0.00014080905,0.00092161883,0.32870752,0.12205149,0.35928768,0.04479794,0.0030227164],"about_ca_topic_score_codex":0.000008238844,"about_ca_topic_score_gemma":0.000006992368,"teacher_disagreement_score":0.7250083,"about_ca_system_score_codex":0.000059950202,"about_ca_system_score_gemma":0.00008324995,"threshold_uncertainty_score":0.6085423},"labels":[],"label_agreement":null},{"id":"W2965349778","doi":"10.4230/lipics.icalp.2019.84","title":"Short Proofs Are Hard to Find","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Educational Assessment and Pedagogy","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto","keywords":"Mathematical proof; Computer science; Mathematics","score_opus":0.045337903897074434,"score_gpt":0.37259746939666527,"score_spread":0.32725956549959084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965349778","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9134016,0.000020295942,0.0006983661,0.004301107,0.002130845,0.0021798522,0.00029984402,0.00012539205,0.07684267],"genre_scores_gemma":[0.9712078,0.000017750364,0.0031465092,0.0022453337,0.0005946481,0.00020166556,0.00030627186,0.000031680145,0.022248331],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976856,0.000045739253,0.0006206886,0.00022711583,0.0006940174,0.00072685117],"domain_scores_gemma":[0.9985693,0.00016497335,0.00019237112,0.0003902458,0.00036377064,0.00031930738],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000796892,0.00024309634,0.00032675726,0.00019282644,0.00053682626,0.00033807484,0.00065570313,0.00019774759,0.00064364],"category_scores_gemma":[0.00010468975,0.00023010408,0.00017569326,0.0003134352,0.00009152349,0.0009765734,0.0001289751,0.00025651034,0.0016030642],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014538944,0.0005075616,0.76847166,0.00043585422,0.00017675616,0.0000016124761,0.087937936,0.000083759565,0.000084638705,0.048740424,0.076719165,0.01669527],"study_design_scores_gemma":[0.0006158781,0.00013472694,0.079855025,0.00010453966,0.00002403099,0.0000024950084,0.022816874,0.00021372603,0.000084769046,0.0008088103,0.8948835,0.00045560778],"about_ca_topic_score_codex":0.00010533002,"about_ca_topic_score_gemma":0.00037972213,"teacher_disagreement_score":0.81816435,"about_ca_system_score_codex":0.00021975873,"about_ca_system_score_gemma":0.00030960474,"threshold_uncertainty_score":0.9991743},"labels":[],"label_agreement":null},{"id":"W2965474919","doi":"10.4230/lipics.ccc.2019.1","title":"Criticality of Regular Formulas","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Combinatorics; Boolean function; Upper and lower bounds; Satisfiability; Discrete mathematics; Bounded function; Criticality; Function (biology); Pigeonhole principle; Lemma (botany); Tree (set theory); Class (philosophy); Computer science","score_opus":0.01088334422631499,"score_gpt":0.24616431488463897,"score_spread":0.23528097065832398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965474919","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23521507,0.00006732503,0.7462919,0.0007061192,0.0018781191,0.0014874851,0.00037570274,0.0003226826,0.013655618],"genre_scores_gemma":[0.8645991,0.000014985151,0.13391599,0.00086841703,0.0000832442,0.000042427644,0.00009792131,0.000025736348,0.0003521624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99719447,0.00003813767,0.0011327773,0.0003034715,0.0006301861,0.0007009401],"domain_scores_gemma":[0.99742705,0.00023104927,0.00032522358,0.0014346073,0.000389419,0.0001926407],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007368809,0.00031318594,0.0005365694,0.000244877,0.0001788467,0.00022386112,0.0017936478,0.00018628291,0.00006645596],"category_scores_gemma":[0.000097762495,0.00028805758,0.00038783244,0.00045468533,0.00017651115,0.0018140436,0.0007127272,0.00032260743,0.00016805252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007490972,0.0005713291,0.0054570343,0.0015248164,0.00018021547,0.000004991843,0.004808635,0.00009906101,0.0002996864,0.95803845,0.0029602232,0.02598064],"study_design_scores_gemma":[0.008473298,0.0015005134,0.0072390805,0.0006355774,0.00008048188,0.00020526943,0.0014889662,0.58953893,0.021603083,0.16361521,0.20364144,0.0019781296],"about_ca_topic_score_codex":0.000014469969,"about_ca_topic_score_gemma":0.0000033487158,"teacher_disagreement_score":0.7944232,"about_ca_system_score_codex":0.00006123246,"about_ca_system_score_gemma":0.0000691957,"threshold_uncertainty_score":0.99995714},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; 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","score_opus":0.012539583983443844,"score_gpt":0.26311127491193836,"score_spread":0.2505716909284945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965627508","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.109076016,0.000022224012,0.88678765,0.00029775084,0.0006073015,0.0011456048,0.000043490894,0.0007376367,0.0012823244],"genre_scores_gemma":[0.43896666,0.0000067586307,0.55946857,0.0010527191,0.00005141806,0.000053468797,0.00021149231,0.000024151683,0.00016477777],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974884,0.00006282621,0.0009012475,0.0003781448,0.00054355006,0.0006258714],"domain_scores_gemma":[0.99797857,0.00015350957,0.0004972936,0.0008593082,0.00034510557,0.00016623859],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006956856,0.00036025597,0.0003744407,0.00028904475,0.00030771238,0.00060554664,0.0011590814,0.00021976972,0.0000245337],"category_scores_gemma":[0.0000517336,0.00034896604,0.00020960177,0.00041275684,0.00005569498,0.0017275725,0.00034221695,0.00035126522,0.00017297339],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025513573,0.00095976575,0.015555911,0.0013115508,0.00030721546,0.0000048825877,0.009679244,0.9104272,0.0018673935,0.034407284,0.004289962,0.020934444],"study_design_scores_gemma":[0.0022205594,0.00024253436,0.00047605712,0.00011928571,0.000015404334,0.000011904001,0.00019564576,0.98734146,0.005064616,0.00038270673,0.003455431,0.0004744167],"about_ca_topic_score_codex":0.000009118323,"about_ca_topic_score_gemma":0.0000016550387,"teacher_disagreement_score":0.32989067,"about_ca_system_score_codex":0.00018461328,"about_ca_system_score_gemma":0.00017915436,"threshold_uncertainty_score":0.9998962},"labels":[],"label_agreement":null},{"id":"W2965722881","doi":"10.4230/lipics.ccc.2019.29","title":"Optimal Separation and Strong Direct Sum for Randomized Query Complexity","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Bounded function; Function (biology); Randomized algorithm; Communication complexity; Discrete mathematics; Combinatorics; Mathematical analysis","score_opus":0.022314205953207728,"score_gpt":0.28291295491487933,"score_spread":0.2605987489616716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965722881","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16417025,0.000086859734,0.82540435,0.00037637216,0.0013685027,0.003912152,0.00041755947,0.0002846982,0.0039792843],"genre_scores_gemma":[0.686546,0.00004465157,0.31099674,0.0006760921,0.00019559497,0.0004613044,0.00052701926,0.000042059004,0.00051049556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973978,0.000084952684,0.0010292191,0.00039601617,0.00040246986,0.0006895885],"domain_scores_gemma":[0.9976817,0.0007025231,0.0004418004,0.0007205809,0.00027302318,0.00018040792],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013869047,0.0003963455,0.00088545843,0.00024822043,0.00041644444,0.0006713561,0.0008673752,0.00016799865,0.000022972017],"category_scores_gemma":[0.00011320464,0.00035169846,0.00042267467,0.0002382149,0.0002713783,0.0020811653,0.00045073306,0.0002647233,0.000040779592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.012838786,0.00080388127,0.0033931376,0.002401411,0.0010559644,0.0000036861363,0.023565717,0.0026246072,0.00012757626,0.922,0.006959768,0.024225468],"study_design_scores_gemma":[0.054960046,0.0002910754,0.00026699007,0.000099742254,0.000048048125,0.000026767037,0.00047384875,0.91963035,0.00040965943,0.0063625355,0.016847828,0.0005831228],"about_ca_topic_score_codex":0.00003054435,"about_ca_topic_score_gemma":0.000018244587,"teacher_disagreement_score":0.9170057,"about_ca_system_score_codex":0.00006915165,"about_ca_system_score_gemma":0.00007213917,"threshold_uncertainty_score":0.9998935},"labels":[],"label_agreement":null},{"id":"W2966029787","doi":"10.4230/lipics.ccc.2019.25","title":"Complexity Lower Bounds for Computing the Approximately-Commuting Operator Value of Non-Local Games to High Precision","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematical proof; Gas meter prover; Operator (biology); Upper and lower bounds; Soundness; Mathematics; Completeness (order theory); Discrete mathematics; Value (mathematics); Class (philosophy); Complexity class; Combinatorics; Time complexity; Computer science","score_opus":0.015284144150633644,"score_gpt":0.2675084582222198,"score_spread":0.2522243140715862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966029787","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38714543,0.000023430308,0.606727,0.00020616529,0.0013768203,0.0019310463,0.000101074875,0.000109026216,0.0023800274],"genre_scores_gemma":[0.88996214,0.0000031299705,0.108694054,0.0008602663,0.00014981302,0.000073875664,0.00007592918,0.000036322457,0.0001445025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99658966,0.000074071875,0.0013499574,0.00043769443,0.0005868601,0.0009617485],"domain_scores_gemma":[0.99653345,0.0006929886,0.0005837816,0.0013434961,0.00062291604,0.0002233743],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017614226,0.0004650877,0.00075699744,0.00018801799,0.00064460497,0.00064587616,0.0026717081,0.0002070014,0.000016963259],"category_scores_gemma":[0.00021735435,0.0003252461,0.00037535393,0.00047204466,0.00021480008,0.0010439672,0.001491656,0.00037525682,0.0001248696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011283229,0.0024193102,0.019359242,0.004675205,0.0008172314,0.000005363471,0.107159525,0.014132645,0.0013524782,0.6550393,0.016398808,0.17751259],"study_design_scores_gemma":[0.0032477411,0.0009823688,0.003362127,0.00041639069,0.000033099852,0.000027241975,0.0016820794,0.962709,0.004134433,0.0025003667,0.020245533,0.00065962865],"about_ca_topic_score_codex":0.000060597595,"about_ca_topic_score_gemma":0.000015457854,"teacher_disagreement_score":0.94857633,"about_ca_system_score_codex":0.00016159924,"about_ca_system_score_gemma":0.00014219678,"threshold_uncertainty_score":0.99991995},"labels":[],"label_agreement":null},{"id":"W2968697199","doi":"10.4230/lipics.mfcs.2020.26","title":"Span Programs and Quantum Time Complexity","year":2020,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"QuantERA; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Canadian Institute for Advanced Research","keywords":"Span (engineering); Computer science; Structural engineering; Engineering","score_opus":0.03405248869646342,"score_gpt":0.2589164173791722,"score_spread":0.22486392868270877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2968697199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17912425,0.0002318531,0.8038238,0.0054695327,0.0027935763,0.004004749,0.00086224877,0.001954879,0.0017350628],"genre_scores_gemma":[0.5399454,0.000072212766,0.452876,0.0028977448,0.00110189,0.0002752777,0.002402391,0.00018478399,0.00024429022],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995647,0.0000953885,0.0014503832,0.00091449934,0.0007684978,0.0011242244],"domain_scores_gemma":[0.9965699,0.00015108062,0.0009037258,0.0015244844,0.00028533567,0.0005655311],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006552122,0.0009478654,0.0011558726,0.0002733616,0.00052815786,0.0018333369,0.002839275,0.0005434071,0.000010913105],"category_scores_gemma":[0.00008668699,0.00085156364,0.00047624172,0.00035038785,0.0003539491,0.0005871224,0.005929237,0.0018208433,0.00015429544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045102078,0.0027065196,0.006312046,0.017111372,0.00280628,0.00020908845,0.0992243,0.0071926196,0.00014524497,0.18620476,0.03648323,0.6411535],"study_design_scores_gemma":[0.0011732973,0.0003881679,0.0006035699,0.00047914797,0.000045018878,0.000106206855,0.00009920541,0.94091785,0.000050541792,0.027082382,0.028071916,0.0009826897],"about_ca_topic_score_codex":0.000042780383,"about_ca_topic_score_gemma":0.000007815143,"teacher_disagreement_score":0.93372524,"about_ca_system_score_codex":0.00009778709,"about_ca_system_score_gemma":0.00021118994,"threshold_uncertainty_score":0.9993935},"labels":[],"label_agreement":null},{"id":"W2970633507","doi":"10.4230/lipics.swat.2020.12","title":"A Simple Algorithm for Minimum Cuts in Near-Linear Time","year":2019,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Minimum cut; Combinatorics; Simple (philosophy); Subroutine; Vertex (graph theory); Time complexity; Undirected graph; Minimum spanning tree; Spanning tree; Mathematics; Running time; Algorithm; Matching (statistics); Graph; Enhanced Data Rates for GSM Evolution; Computer science","score_opus":0.021239953373996097,"score_gpt":0.30963520775811404,"score_spread":0.28839525438411795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2970633507","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022614207,0.00013763017,0.96335655,0.00026857358,0.0014304067,0.007121,0.00325086,0.00039051415,0.001430259],"genre_scores_gemma":[0.043406416,0.00013513358,0.9409443,0.0018627753,0.0006614087,0.0029504278,0.0053996616,0.00038676834,0.0042531043],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99373364,0.00012584051,0.0020724323,0.0010411533,0.0010490674,0.0019778674],"domain_scores_gemma":[0.9942572,0.0008061425,0.0009138348,0.0028877442,0.00074025884,0.0003947992],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019451281,0.0009764981,0.0013785942,0.000836234,0.00035044062,0.0009771282,0.004877477,0.0008674651,0.000039079492],"category_scores_gemma":[0.00026471278,0.0009678542,0.0007792048,0.00067138014,0.00027219337,0.0018270444,0.0046115676,0.0016919959,0.0006271013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002060578,0.0048072427,0.008899266,0.019048871,0.0027057193,0.00015457816,0.050148185,0.06025014,0.00030315702,0.03607946,0.068141595,0.7474012],"study_design_scores_gemma":[0.0036706682,0.00037189072,0.000089158304,0.00032305223,0.000023915747,0.000023634297,0.00014179628,0.90576845,0.0003511384,0.022318669,0.06590252,0.0010150949],"about_ca_topic_score_codex":0.000020450432,"about_ca_topic_score_gemma":0.000010548169,"teacher_disagreement_score":0.8455183,"about_ca_system_score_codex":0.00041494108,"about_ca_system_score_gemma":0.00066116883,"threshold_uncertainty_score":0.9992772},"labels":[],"label_agreement":null},{"id":"W2970698689","doi":"10.4230/lipics.concur.2019.31","title":"Expressive Power of Broadcast Consensus Protocols","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Unary operation; Computer science; Class (philosophy); Population; Theoretical computer science; Decidability; Protocol (science); Atomic broadcast; Expressive power; Computation; Power (physics); Distributed computing; Discrete mathematics; Broadcasting (networking); Algorithm; Computer network; Mathematics; Artificial intelligence","score_opus":0.01223587976930665,"score_gpt":0.26594943568258356,"score_spread":0.25371355591327693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2970698689","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5051309,0.00013202122,0.38092166,0.00057263405,0.003270608,0.050986752,0.0035523796,0.0006575171,0.05477554],"genre_scores_gemma":[0.9807557,0.000002342004,0.01576178,0.00039991268,0.00005571383,0.0020880091,0.00010683604,0.00003292918,0.0007968146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99698037,0.00004337497,0.0013660112,0.00032676553,0.0006094213,0.0006740527],"domain_scores_gemma":[0.9969021,0.0001321821,0.0008808398,0.0013394151,0.00055942556,0.00018605376],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047154614,0.00036285812,0.0006467296,0.00016503212,0.00012561132,0.00029216168,0.001503679,0.00021333888,0.000052625623],"category_scores_gemma":[0.00006739585,0.00031164306,0.00027649445,0.00034750008,0.00010911718,0.0009818944,0.00040823087,0.00027856528,0.0003128594],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020705624,0.005621121,0.085999906,0.016572496,0.0021259207,0.000114349365,0.13141923,0.0034711899,0.014168037,0.449979,0.20067343,0.08778477],"study_design_scores_gemma":[0.0142767355,0.0017060046,0.003214282,0.0022103183,0.00003132065,0.00026189775,0.0036032859,0.101921014,0.016089775,0.0011334355,0.8536893,0.0018626365],"about_ca_topic_score_codex":0.0000124428725,"about_ca_topic_score_gemma":0.0000013884021,"teacher_disagreement_score":0.65301585,"about_ca_system_score_codex":0.00006605134,"about_ca_system_score_gemma":0.00013038937,"threshold_uncertainty_score":0.99993354},"labels":[],"label_agreement":null},{"id":"W2970703080","doi":"10.4230/lipics.mfcs.2019.60","title":"Approximate Counting CSP Seen from the Other Side","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Computer science","score_opus":0.010326148565543786,"score_gpt":0.2228140260968382,"score_spread":0.21248787753129442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2970703080","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0925627,0.000028018278,0.883701,0.0016654495,0.0015255269,0.0013921565,0.0003148952,0.00038499048,0.018425252],"genre_scores_gemma":[0.9155736,0.000019569541,0.07597386,0.0069538034,0.00023992691,0.0000807621,0.00027404056,0.000052319283,0.0008320975],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981202,0.00003938059,0.0006906787,0.00025323406,0.0004243497,0.00047214146],"domain_scores_gemma":[0.9982498,0.00025907526,0.0003897881,0.0008347347,0.00017332094,0.00009322821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050066813,0.00026523796,0.00026341053,0.00009175993,0.00029227027,0.0006952898,0.0009901315,0.00013386057,0.00016986454],"category_scores_gemma":[0.00005593453,0.00019699443,0.00015985213,0.00025933434,0.00006755964,0.0017023839,0.00030688033,0.00028559737,0.0005681406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024353883,0.000558185,0.31718668,0.00081256527,0.0010906468,0.000008116987,0.07876648,0.013420091,0.00095582893,0.2426079,0.021828145,0.3225218],"study_design_scores_gemma":[0.0024761118,0.000071622155,0.0083845565,0.00013124665,0.000027277154,0.00002459704,0.001465135,0.82616764,0.00058004557,0.0014486299,0.15864451,0.00057859137],"about_ca_topic_score_codex":0.00008913584,"about_ca_topic_score_gemma":0.000047406316,"teacher_disagreement_score":0.8230109,"about_ca_system_score_codex":0.00007578124,"about_ca_system_score_gemma":0.000070177826,"threshold_uncertainty_score":0.80332},"labels":[],"label_agreement":null},{"id":"W2971070621","doi":"10.4230/lipics.concur.2019.9","title":"Computing Probabilistic Bisimilarity Distances for Probabilistic Automata","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Probabilistic logic; Computer science; Probabilistic automaton; Automaton; Theoretical computer science; Artificial intelligence","score_opus":0.011532384648756541,"score_gpt":0.2636695619378635,"score_spread":0.25213717728910695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971070621","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.096141145,0.000047342215,0.891601,0.00090432056,0.0024522976,0.003997268,0.00045448754,0.0009554405,0.00344666],"genre_scores_gemma":[0.8022777,0.0000060422476,0.19508892,0.0008148628,0.00029892108,0.00022258241,0.00046265707,0.000067542125,0.00076078495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99639064,0.0000689635,0.0012533912,0.00060621905,0.00060708856,0.0010737219],"domain_scores_gemma":[0.9967661,0.0006578408,0.00063738774,0.0012935104,0.00040288153,0.00024227658],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013183063,0.00052075105,0.00067752606,0.00020872336,0.00054169446,0.00086874247,0.0019961577,0.00020896907,0.000018221228],"category_scores_gemma":[0.00048157742,0.00044782853,0.00033677238,0.0004396103,0.00012911743,0.0013472422,0.000620668,0.0005103045,0.00013547404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005119619,0.0028843114,0.035990275,0.021154143,0.00079283875,0.000016388673,0.032210175,0.031035481,0.00009616494,0.5479634,0.017412405,0.3099325],"study_design_scores_gemma":[0.0025145756,0.00045935842,0.0009783888,0.00023736978,0.000028608407,0.00003139126,0.00019762182,0.9220527,0.00004263471,0.0065279244,0.06630583,0.0006236101],"about_ca_topic_score_codex":0.000018138671,"about_ca_topic_score_gemma":0.000012440722,"teacher_disagreement_score":0.8910172,"about_ca_system_score_codex":0.00016193186,"about_ca_system_score_gemma":0.00016465843,"threshold_uncertainty_score":0.99979734},"labels":[],"label_agreement":null},{"id":"W2973098730","doi":"10.4230/lipics.mfcs.2020.20","title":"Homomorphisms of signed graphs: An update","year":2019,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada; Horizon 2020 Framework Programme; Grantová Agentura, Univerzita Karlova; European Commission; Univerzita Karlova v Praze","keywords":"Signed graph; Combinatorics; Homomorphism; Graph homomorphism; Mathematics; Discrete mathematics; Adjacency list; Graph; Line graph; Graph power","score_opus":0.024735935971948956,"score_gpt":0.2980308278716488,"score_spread":0.27329489189969985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2973098730","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12814486,0.00019595091,0.8595405,0.00020604214,0.0021853363,0.0039434014,0.0022172816,0.00050851254,0.0030580573],"genre_scores_gemma":[0.8563431,0.00019110375,0.13981827,0.00071049936,0.00013506536,0.00040186083,0.0019155054,0.00015297277,0.00033165773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99382406,0.00020775529,0.0022042063,0.00091041514,0.0014288994,0.0014246706],"domain_scores_gemma":[0.9919629,0.0003023687,0.0016000231,0.0045744693,0.0010825089,0.0004777124],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001817307,0.00094697054,0.001409711,0.0012344994,0.00028271857,0.0006532608,0.007038863,0.00078254624,0.00005022876],"category_scores_gemma":[0.00014608011,0.00089786964,0.0007905806,0.00076424313,0.00047443167,0.002906528,0.004757823,0.0016279061,0.00022569424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00087203644,0.0021386936,0.0031574434,0.008727442,0.0014955271,0.00004210215,0.015850237,0.011604701,0.0008563139,0.90857995,0.004473557,0.042201996],"study_design_scores_gemma":[0.008398527,0.0022792493,0.00084082596,0.0015168049,0.00018413863,0.00012505517,0.0014015295,0.38533217,0.011563999,0.56021655,0.024167266,0.003973871],"about_ca_topic_score_codex":0.00001799024,"about_ca_topic_score_gemma":0.000007535707,"teacher_disagreement_score":0.7281982,"about_ca_system_score_codex":0.00017282047,"about_ca_system_score_gemma":0.00040688674,"threshold_uncertainty_score":0.9993472},"labels":[],"label_agreement":null},{"id":"W2975226411","doi":"10.4230/lipics.socg.2016.63","title":"Approximating Convex Shapes With Respect to Symmetric Difference Under Homotheties","year":2016,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Institute for Information and Communications Technology Promotion; Natural Sciences and Engineering Research Council of Canada; Center for Massive Data Algorithmics; Korea Advanced Institute of Science and Technology; National Research Foundation of Korea; Danmarks Grundforskningsfond; Ministry of Science, ICT and Future Planning; National Research Foundation","keywords":"Mathematics; Regular polygon; Combinatorics; Pure mathematics; Geometry","score_opus":0.04886053309053268,"score_gpt":0.2961416573089014,"score_spread":0.24728112421836873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2975226411","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52433425,0.00008208924,0.4582556,0.001125491,0.00028019765,0.0016887432,0.0007272577,0.00042941995,0.013076964],"genre_scores_gemma":[0.9508612,0.00004007233,0.04211509,0.0010215197,0.00018390945,0.00030983536,0.000034368415,0.00011139277,0.005322597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962673,0.00004705744,0.0014154466,0.00035932192,0.0008434391,0.0010673994],"domain_scores_gemma":[0.9962975,0.0015713254,0.00065188814,0.00063830556,0.00055719545,0.00028381968],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009527764,0.0005751917,0.0008381898,0.00095566374,0.00037194075,0.0003561609,0.0007755611,0.00020588703,0.00012589271],"category_scores_gemma":[0.0013849257,0.00034268355,0.00020314804,0.0011556945,0.00017944505,0.0008395723,0.00031269615,0.00026661454,0.00014263054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009873403,0.00095577183,0.0054120775,0.0067128325,0.00090726465,0.000011721156,0.027806157,0.00003471346,0.00030895273,0.899545,0.0073135057,0.050004676],"study_design_scores_gemma":[0.031733993,0.008911566,0.006851153,0.010244705,0.00095380394,0.00075560686,0.07147927,0.011252026,0.021427827,0.7160454,0.11091031,0.009434382],"about_ca_topic_score_codex":0.000018223798,"about_ca_topic_score_gemma":0.000027938597,"teacher_disagreement_score":0.42652696,"about_ca_system_score_codex":0.00019201261,"about_ca_system_score_gemma":0.000108189786,"threshold_uncertainty_score":0.99990255},"labels":[],"label_agreement":null},{"id":"W2977350080","doi":"10.4230/lipics.approx-random.2019.56","title":"String Matching: Communication, Circuits, and Learning","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"String searching algorithm; Upper and lower bounds; VC dimension; Communication complexity; Matching (statistics); String (physics); Sample complexity; Mathematics; Computational complexity theory; Circuit complexity; Pattern matching; Dimension (graph theory); Classifier (UML); Discrete mathematics; Theoretical computer science; Computer science; Electronic circuit; Algorithm; Combinatorics; Artificial intelligence","score_opus":0.009260590006367071,"score_gpt":0.23186566141304576,"score_spread":0.2226050714066787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2977350080","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3956515,0.00024074201,0.59778273,0.000295948,0.0005213167,0.000829438,0.00006926216,0.00035310167,0.0042559574],"genre_scores_gemma":[0.9349178,0.0001260575,0.06362992,0.00047337357,0.000048516344,0.000031576168,0.00026032646,0.000026633934,0.00048577928],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829155,0.000056709214,0.0006173642,0.00024787843,0.0003404154,0.00044605558],"domain_scores_gemma":[0.99814975,0.00020996868,0.0003279969,0.0010137137,0.00014955954,0.00014903057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066591665,0.00024242325,0.00029184457,0.00015459728,0.00052719604,0.0006878875,0.001291236,0.00012511341,0.000020140213],"category_scores_gemma":[0.000046069654,0.00021898234,0.0000809322,0.00019730243,0.000048658745,0.002723784,0.0012313065,0.00055125577,0.00013219516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007194582,0.0005592306,0.056670006,0.0020475537,0.00037103676,0.000007780313,0.07400715,0.003246212,0.00088805595,0.3978469,0.0071120667,0.45717204],"study_design_scores_gemma":[0.005245824,0.00041420315,0.00910229,0.00074173976,0.000032609743,0.00016043318,0.00435998,0.6235982,0.0006767676,0.008056708,0.34625304,0.0013581561],"about_ca_topic_score_codex":0.000030024561,"about_ca_topic_score_gemma":0.0000029646205,"teacher_disagreement_score":0.620352,"about_ca_system_score_codex":0.00004965766,"about_ca_system_score_gemma":0.000041618034,"threshold_uncertainty_score":0.89298403},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.013423494992439852,"score_gpt":0.2472337597318089,"score_spread":0.23381026473936903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979929440","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10442712,0.00020632902,0.8838455,0.0006852809,0.0063355453,0.0019481209,0.0004481228,0.00084008713,0.0012639152],"genre_scores_gemma":[0.75103396,0.00014548085,0.24317424,0.0017886114,0.0010799252,0.0002591993,0.0016906211,0.00018658549,0.00064137805],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947383,0.000107609114,0.0018129038,0.00093084626,0.0010379357,0.0013724],"domain_scores_gemma":[0.9949565,0.00027087613,0.0013314126,0.0026010189,0.0005089719,0.00033120054],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011136322,0.0010353402,0.0011371847,0.000593916,0.00053311285,0.0014877087,0.0037877636,0.00087512063,0.000022204566],"category_scores_gemma":[0.00009035914,0.00093202374,0.0007243499,0.00043503696,0.00013839608,0.001124399,0.004313226,0.0019876363,0.000527813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042556057,0.0026629106,0.0047150156,0.018093806,0.0022342973,0.00009797471,0.054631703,0.43177506,0.0005122428,0.098614,0.051125266,0.33511215],"study_design_scores_gemma":[0.0012777058,0.00026333774,0.0003294628,0.00061769877,0.00004628048,0.00008632287,0.00012524491,0.94475937,0.00032027697,0.015593045,0.03545635,0.0011249318],"about_ca_topic_score_codex":0.00008200818,"about_ca_topic_score_gemma":0.000009040711,"teacher_disagreement_score":0.64660686,"about_ca_system_score_codex":0.0002486873,"about_ca_system_score_gemma":0.00035703724,"threshold_uncertainty_score":0.99954885},"labels":[],"label_agreement":null},{"id":"W2980088699","doi":"10.4230/lipics.csl.2020.17","title":"Tangent Categories from the Coalgebras of Differential Categories","year":2019,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Homotopy and Cohomology in Algebraic Topology","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University; University of Calgary","funders":"Clarendon Fund; Natural Sciences and Engineering Research Council of Canada; DeepMind","keywords":"Mathematics; Category of groups; Closed category; Differential (mechanical device); Category theory; Tangent; Pure mathematics; Concrete category; Derived category; Biproduct; Equivalence of categories; Algebra over a field; Enriched category; Abelian group; Abelian category; Geometry; Functor","score_opus":0.03294372047147163,"score_gpt":0.29455122918852883,"score_spread":0.2616075087170572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980088699","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9387456,0.00044813252,0.03646524,0.0011823624,0.008502626,0.003956632,0.0069427807,0.0002736097,0.003482972],"genre_scores_gemma":[0.99050874,0.00017948302,0.0032544637,0.0005584756,0.00072377734,0.0005034037,0.0032552315,0.00014089947,0.00087553647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99469674,0.00024069154,0.0026485473,0.0005779082,0.0007822478,0.0010538774],"domain_scores_gemma":[0.9927838,0.0019100138,0.002140634,0.0024542352,0.00053240365,0.00017891417],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.000715886,0.0010632114,0.0019435672,0.00021574153,0.00039443566,0.00023574496,0.0024436216,0.0015612997,0.0006148147],"category_scores_gemma":[0.00057598617,0.0007712082,0.0008812178,0.00016865968,0.0011036509,0.00030420057,0.0023504652,0.0019328874,0.00015591465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012914554,0.0017664537,0.033882525,0.007828195,0.0068874154,0.000025416464,0.10617089,0.00011515323,0.00014642072,0.78020424,0.05804942,0.003632408],"study_design_scores_gemma":[0.0058341874,0.0006808095,0.0033559534,0.0008193925,0.0019647079,0.0000879582,0.013118216,0.0026907588,0.007189078,0.92860293,0.03333674,0.0023192777],"about_ca_topic_score_codex":0.00036867155,"about_ca_topic_score_gemma":0.00032735872,"teacher_disagreement_score":0.14839867,"about_ca_system_score_codex":0.00018459701,"about_ca_system_score_gemma":0.00044359622,"threshold_uncertainty_score":0.9997349},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06788203052079886,"score_gpt":0.2681875824002677,"score_spread":0.20030555187946883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982393288","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33579358,0.00009952407,0.6583152,0.0018882196,0.00047594385,0.0023324385,0.0005414812,0.00015396926,0.0003996366],"genre_scores_gemma":[0.82018083,0.000036040765,0.17783457,0.0014735354,0.00011142906,0.00017133648,0.00014091158,0.00003511286,0.000016203434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99734867,0.000047759484,0.0011081187,0.00038393147,0.0004409993,0.00067051157],"domain_scores_gemma":[0.99852943,0.0001652522,0.00029292653,0.0004876679,0.00025295815,0.00027174136],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00076175266,0.0003293445,0.00058838667,0.00029779456,0.00023488798,0.00033533806,0.0013160001,0.00014017458,0.000009178654],"category_scores_gemma":[0.00009629143,0.00031554644,0.00018005488,0.0006675742,0.00027534753,0.0012375369,0.00096262567,0.00033853066,0.000007708535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030713677,0.0011646999,0.051888637,0.0105541805,0.00046886344,0.000014836676,0.11055731,0.0015570928,0.00096020766,0.76578534,0.004577898,0.052163813],"study_design_scores_gemma":[0.0063807433,0.00089749444,0.0037367453,0.00032244602,0.000026771086,0.000043376112,0.0010687618,0.9404,0.006061665,0.026688872,0.013507634,0.0008654775],"about_ca_topic_score_codex":0.0000506192,"about_ca_topic_score_gemma":0.000044877623,"teacher_disagreement_score":0.9388429,"about_ca_system_score_codex":0.000048352864,"about_ca_system_score_gemma":0.000109777095,"threshold_uncertainty_score":0.99992967},"labels":[],"label_agreement":null},{"id":"W2982703654","doi":"10.4230/lipics.disc.2019.26","title":"The Complexity of Symmetry Breaking in Massive Graphs","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Omega; Combinatorics; Upper and lower bounds; Symmetry breaking; Graph; Algorithm; Mathematics; Time complexity; Discrete mathematics; Physics; Particle physics; Mathematical analysis","score_opus":0.022236742729631654,"score_gpt":0.26792577825810493,"score_spread":0.24568903552847327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982703654","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8040632,0.000095710144,0.17289056,0.0009504159,0.002258824,0.002625128,0.00010868479,0.0006233482,0.016384127],"genre_scores_gemma":[0.9628048,0.00001820472,0.036709968,0.0002688417,0.000020056284,0.000057269495,0.000021357038,0.000023665674,0.00007582305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99730957,0.000071917864,0.0011483078,0.00026831953,0.0005245493,0.00067735615],"domain_scores_gemma":[0.9972058,0.00045105492,0.0007179892,0.001252712,0.00028589004,0.00008658965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011716796,0.00030051955,0.0004483766,0.00037137975,0.0002197699,0.00024990248,0.0022411365,0.00016260493,0.000006297432],"category_scores_gemma":[0.000155324,0.00023345195,0.0002386886,0.00076284166,0.00026814683,0.00119801,0.0007949011,0.0005024135,0.000043973087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001316466,0.0003647931,0.10177259,0.0008693256,0.00015571745,0.0000062293116,0.014989196,0.00013157487,0.00045943324,0.8340592,0.002062361,0.04499794],"study_design_scores_gemma":[0.008750031,0.002197399,0.051098347,0.002280137,0.000067516055,0.00022584162,0.008481819,0.6277354,0.031234995,0.2307858,0.03420878,0.0029339623],"about_ca_topic_score_codex":0.00009234073,"about_ca_topic_score_gemma":0.00010791774,"teacher_disagreement_score":0.62760377,"about_ca_system_score_codex":0.00013702008,"about_ca_system_score_gemma":0.00008016105,"threshold_uncertainty_score":0.9519894},"labels":[],"label_agreement":null},{"id":"W2989796728","doi":"10.4230/lipics.opodis.2019.16","title":"Byzantine-Tolerant Set-Constrained Delivery Broadcast","year":2020,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Set (abstract data type); Object (grammar); Mathematics; Discrete mathematics; Combinatorics; Task (project management); Computer science; Artificial intelligence","score_opus":0.030149361340502206,"score_gpt":0.26389688453854215,"score_spread":0.23374752319803996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2989796728","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03941114,0.00042988054,0.9278607,0.0022075432,0.0064517455,0.0036985124,0.008107217,0.0012989505,0.010534308],"genre_scores_gemma":[0.95605195,0.00012889014,0.035180036,0.0028393003,0.00080771814,0.00045448338,0.004066121,0.00012788732,0.00034364275],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99339235,0.00010051405,0.0028090803,0.001086162,0.0011497914,0.0014620778],"domain_scores_gemma":[0.99457705,0.00016196372,0.001577528,0.0022763393,0.00075764145,0.0006494824],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007528017,0.0012442087,0.0016401979,0.0003431648,0.0004692986,0.0019716641,0.0044107176,0.0009188413,0.000023184159],"category_scores_gemma":[0.00011804228,0.001190473,0.0009682736,0.00054325745,0.00021914682,0.0015755001,0.003330688,0.001814515,0.00034834418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013468018,0.0035511015,0.007515792,0.04064166,0.0070761587,0.0010752634,0.13899735,0.017914327,0.0012799164,0.20724548,0.26086366,0.3124925],"study_design_scores_gemma":[0.004165834,0.0002520491,0.0003624894,0.0013860093,0.00010546335,0.00020862631,0.0009317861,0.63280624,0.00047056476,0.0008408719,0.35641086,0.00205921],"about_ca_topic_score_codex":0.00007248882,"about_ca_topic_score_gemma":0.000012439316,"teacher_disagreement_score":0.91664076,"about_ca_system_score_codex":0.00016145568,"about_ca_system_score_gemma":0.000570798,"threshold_uncertainty_score":0.9990644},"labels":[],"label_agreement":null},{"id":"W2990002113","doi":"10.4230/lipics.isaac.2019.45","title":"Path and Ancestor Queries over Trees with Multidimensional Weight Vectors","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ancestor; Path (computing); Computer science; Theoretical computer science; Tree (set theory); Combinatorics; Mathematics; Algorithm; Geography; Computer network","score_opus":0.00610076255544151,"score_gpt":0.20920867595822878,"score_spread":0.20310791340278728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2990002113","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91042525,0.00010961816,0.08263077,0.00035260673,0.0014441478,0.0013150865,0.00037309076,0.00031066567,0.00303878],"genre_scores_gemma":[0.8261174,0.00012054432,0.16872607,0.0016356095,0.00021761599,0.00011987426,0.00059652264,0.00006358373,0.0024027724],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.99812865,0.0000186401,0.00047906104,0.00034255537,0.0005007774,0.00053029606],"domain_scores_gemma":[0.9986945,0.00008800113,0.0002578108,0.0007008625,0.00010644736,0.00015242839],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026479413,0.0003407197,0.0003429971,0.00018473309,0.00020925338,0.0004311369,0.000700638,0.00008625825,0.00003671169],"category_scores_gemma":[0.000014528823,0.00025047892,0.000082430066,0.0002468402,0.00011637364,0.003928672,0.0005661697,0.00018844374,0.000110737186],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00077478687,0.0013829246,0.5322987,0.0029532425,0.0012606174,0.00007530345,0.024913166,0.00037029796,0.00040509738,0.29421207,0.04531512,0.0960387],"study_design_scores_gemma":[0.0091572115,0.0013586461,0.0663972,0.0004854606,0.00007012031,0.00007292638,0.0010478251,0.32290372,0.00074910454,0.00055481185,0.5955387,0.0016643055],"about_ca_topic_score_codex":0.00002030565,"about_ca_topic_score_gemma":0.00002193044,"teacher_disagreement_score":0.5502235,"about_ca_system_score_codex":0.00004701678,"about_ca_system_score_gemma":0.00004437019,"threshold_uncertainty_score":0.99999475},"labels":[],"label_agreement":null},{"id":"W2990814010","doi":"10.4230/lipics.isaac.2019.46","title":"A 21/16-Approximation for the Minimum 3-Path Partition Problem","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"China Scholarship Council; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Approximation algorithm; Combinatorics; Partition (number theory); Partition problem; Mathematics; Graph partition; Greedy algorithm; Discrete mathematics; Graph; Algorithm","score_opus":0.017539987755028318,"score_gpt":0.27483009011971604,"score_spread":0.25729010236468774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2990814010","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035805125,0.000056482946,0.9536964,0.0009559255,0.00062645087,0.005117531,0.00020871735,0.0002450986,0.0032882283],"genre_scores_gemma":[0.8507239,0.00005075777,0.14250576,0.0014360588,0.00022508625,0.002320796,0.0004884135,0.00008299801,0.0021662249],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997104,0.0000603924,0.0008933801,0.00037248014,0.0006466478,0.0009230862],"domain_scores_gemma":[0.9970558,0.0006107218,0.00044550712,0.0012610592,0.00047086008,0.00015603851],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014972632,0.00033852473,0.00034605933,0.0002324873,0.0005025902,0.00056376366,0.0017390762,0.00016511357,0.000029868339],"category_scores_gemma":[0.00013411941,0.00024732316,0.0002907196,0.0005122035,0.00012807707,0.0027229947,0.0004429733,0.00035050345,0.00028077618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066464674,0.0006418076,0.0032188436,0.0024143523,0.0003640109,0.0000017302592,0.014524281,0.0017527625,0.0009222183,0.8730126,0.013166091,0.08931664],"study_design_scores_gemma":[0.0053387377,0.0009615559,0.00039236146,0.00023386533,0.000042131993,0.000045374534,0.0017064824,0.7372451,0.0035405247,0.10255857,0.14712974,0.00080555904],"about_ca_topic_score_codex":0.000004409331,"about_ca_topic_score_gemma":0.000006296981,"teacher_disagreement_score":0.81491876,"about_ca_system_score_codex":0.00016525772,"about_ca_system_score_gemma":0.00010212605,"threshold_uncertainty_score":0.9999979},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.018530198710314177,"score_gpt":0.27452845219937855,"score_spread":0.25599825348906435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2994217331","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22284399,0.00024307967,0.7711638,0.00055896974,0.002795044,0.001054662,0.00042367383,0.00030414824,0.00061260414],"genre_scores_gemma":[0.655444,0.00009665275,0.34281224,0.0005481883,0.00033753985,0.000049102604,0.0005759966,0.000063638305,0.000072594616],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99452245,0.00016366255,0.0020441134,0.00080997107,0.001230402,0.0012293933],"domain_scores_gemma":[0.9942958,0.0005619419,0.0010357276,0.002858045,0.0008873228,0.00036117376],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.001165046,0.0008587725,0.0013397648,0.0005759883,0.00035050116,0.0010909456,0.0041220956,0.0009878614,0.000031839663],"category_scores_gemma":[0.00024829005,0.00079521333,0.00087306707,0.0007335277,0.00022164902,0.00056916376,0.004614236,0.0028495505,0.000030210222],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038002874,0.0030177953,0.006032918,0.027585912,0.0035343762,0.00025894452,0.17695989,0.24000095,0.00016312949,0.25523153,0.004646042,0.28218848],"study_design_scores_gemma":[0.0009669871,0.0002515821,0.0008896327,0.0019066056,0.000047965365,0.00007441615,0.00079530256,0.97879136,0.00091593224,0.012052172,0.0023893612,0.0009186732],"about_ca_topic_score_codex":0.00010473569,"about_ca_topic_score_gemma":0.000008967514,"teacher_disagreement_score":0.7387904,"about_ca_system_score_codex":0.00011263881,"about_ca_system_score_gemma":0.0006764064,"threshold_uncertainty_score":0.999946},"labels":[],"label_agreement":null},{"id":"W2997607600","doi":"10.4230/lipics.ipec.2019.9","title":"C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Planarity testing; Combinatorics; Book embedding; Parameterized complexity; Planar graph; Mathematics; Embedding; Discrete mathematics; Vertex (graph theory); Graph drawing; Graph; 1-planar graph; Computer science; Line graph","score_opus":0.019458393798127485,"score_gpt":0.2348391680125248,"score_spread":0.21538077421439733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997607600","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8088743,0.000031921358,0.17765145,0.00018934527,0.0012454767,0.0017894878,0.00038671712,0.0004331053,0.009398212],"genre_scores_gemma":[0.79235995,0.0000042578918,0.2067785,0.00045921808,0.00005483909,0.000042396197,0.00013174293,0.00003395764,0.00013512107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99661505,0.00005701636,0.0011946342,0.00043517075,0.00081496505,0.0008831876],"domain_scores_gemma":[0.9966793,0.00039434835,0.0007615519,0.0013947069,0.0005433104,0.00022676788],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00070711935,0.00047985083,0.0007079611,0.00042272452,0.00035442066,0.0004432112,0.0016076245,0.00019872347,0.000026226673],"category_scores_gemma":[0.00010790142,0.00041120368,0.0002581883,0.0009967727,0.00023831097,0.0018517926,0.0006997121,0.00049783575,0.000049711536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013625933,0.0036261952,0.30333504,0.009586053,0.00265937,0.00010601773,0.09305971,0.0033989113,0.0013431592,0.47220597,0.006703404,0.102613576],"study_design_scores_gemma":[0.015858809,0.0038326215,0.016182402,0.0014097955,0.00017119508,0.0007269961,0.0038596238,0.89469326,0.005171048,0.041752134,0.013363266,0.002978844],"about_ca_topic_score_codex":0.000087664775,"about_ca_topic_score_gemma":0.00006618215,"teacher_disagreement_score":0.89129436,"about_ca_system_score_codex":0.00007787592,"about_ca_system_score_gemma":0.00018579962,"threshold_uncertainty_score":0.999834},"labels":[],"label_agreement":null},{"id":"W3004244792","doi":"10.4230/dagrep.9.8.70","title":"Computational Proteomics (Dagstuhl Seminar 19351)","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Genetics, Bioinformatics, and Biomedical Research","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Universitetet i Bergen; Universiteit Gent; Radboud Universiteit; Kungliga Tekniska Högskolan; Eidgenössische Technische Hochschule Zürich; University of Toronto; Buck Institute for Research on Aging; Friedrich-Schiller-Universität Jena; Leids Universitair Medisch Centrum; Universiteit Leiden; Princeton University; Université du Luxembourg; Dartmouth College","keywords":"Breakout; Session (web analytics); Identification (biology); Computer science; Proteome; Data science; Proteomics; World Wide Web; Bioinformatics; Biology","score_opus":0.01050825642027453,"score_gpt":0.2682828677345903,"score_spread":0.2577746113143158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004244792","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9310262,0.00017434495,0.045372397,0.00059070415,0.0014063946,0.0037175287,0.0015514649,0.000097627984,0.01606335],"genre_scores_gemma":[0.92322916,0.0003817842,0.054231647,0.002957828,0.0008500218,0.00027091283,0.009712829,0.00013784846,0.008227978],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99656975,0.000042144115,0.0011895555,0.0003730037,0.0008283562,0.0009971812],"domain_scores_gemma":[0.9978588,0.00007093802,0.0003752109,0.00075918256,0.0005342104,0.00040165635],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007788482,0.00046555288,0.00045641014,0.0002144344,0.00024456662,0.00022443906,0.00086979853,0.00052353245,0.00009599816],"category_scores_gemma":[0.00023168155,0.00041570253,0.00033559208,0.0002076392,0.00028761942,0.00005983509,0.00055607024,0.0004211404,0.0006437459],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.007209568,0.0062234467,0.121253416,0.017876996,0.004865216,0.00003793341,0.017338129,0.013995635,0.18100761,0.007528046,0.4353643,0.18729971],"study_design_scores_gemma":[0.009493185,0.0031491541,0.0027823576,0.00024526546,0.000079135716,0.0001563427,0.0023441145,0.07241016,0.05707881,0.0009082747,0.84957993,0.0017733006],"about_ca_topic_score_codex":0.000007362993,"about_ca_topic_score_gemma":0.000007896164,"teacher_disagreement_score":0.41421562,"about_ca_system_score_codex":0.00008075589,"about_ca_system_score_gemma":0.00028272456,"threshold_uncertainty_score":0.9998295},"labels":[],"label_agreement":null},{"id":"W3008457491","doi":"10.4230/lipics.mfcs.2020.14","title":"Layered Fan-Planar Graph Drawings","year":2020,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Ministero dell’Istruzione, dell’Università e della Ricerca; University of Waterloo; Deutsche Forschungsgemeinschaft","keywords":"Planar graph; Embedding; Planar; Combinatorics; Graph drawing; Pathwidth; Mathematics; Graph; Representation (politics); Book embedding; Computer science; Discrete mathematics; Computer graphics (images); Line graph; Artificial intelligence","score_opus":0.028163835996368642,"score_gpt":0.26729729868200985,"score_spread":0.2391334626856412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3008457491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013429794,0.00013810434,0.9732242,0.002585018,0.0035508315,0.0016046223,0.0008650662,0.00061004027,0.0039923037],"genre_scores_gemma":[0.7697176,0.00012677186,0.21571127,0.006491953,0.0011259264,0.00043021198,0.0057612355,0.00010242963,0.0005326643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99584836,0.00007135785,0.0015838786,0.0007433429,0.00096244377,0.0007906413],"domain_scores_gemma":[0.99671423,0.00018849115,0.0009199585,0.0012237512,0.0005428646,0.0004106717],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005977238,0.00074478675,0.00079656416,0.0006109058,0.00045537806,0.0013790119,0.0025967972,0.0005531804,0.00002529849],"category_scores_gemma":[0.00014670202,0.0007536224,0.0006084913,0.0006930168,0.000084956155,0.0014070908,0.0013169419,0.0011213128,0.00026484817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061702164,0.0018131158,0.0026331441,0.011122597,0.0032856415,0.00014379698,0.07213164,0.061509475,0.0017656529,0.43234405,0.27468288,0.13795097],"study_design_scores_gemma":[0.004687745,0.0006058913,0.0014321323,0.0006496863,0.00016977613,0.00014244695,0.00050768617,0.6242999,0.0048592547,0.09679855,0.26284564,0.0030013006],"about_ca_topic_score_codex":0.000022799624,"about_ca_topic_score_gemma":0.000010674877,"teacher_disagreement_score":0.757513,"about_ca_system_score_codex":0.00016125343,"about_ca_system_score_gemma":0.0003723139,"threshold_uncertainty_score":0.99965763},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.015192216139031833,"score_gpt":0.23245680051203205,"score_spread":0.21726458437300022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011330615","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27229577,0.0002846841,0.7196712,0.0026386387,0.00033436084,0.00084317493,0.00008784413,0.0004191771,0.003425141],"genre_scores_gemma":[0.95535177,0.000019388837,0.041949406,0.0024470363,0.00007898873,0.000011744774,0.00009704542,0.000021151354,0.000023485054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980218,0.00007645937,0.0007703051,0.00032727877,0.00031515132,0.00048902613],"domain_scores_gemma":[0.99817383,0.00033993975,0.0003839811,0.0006475637,0.00015249956,0.0003021677],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056184526,0.00031875356,0.0004091539,0.00010496437,0.00056937186,0.00085347204,0.0010900428,0.00013107502,0.0000042081815],"category_scores_gemma":[0.00014238626,0.0003028188,0.000083687024,0.00019566598,0.0001238456,0.000838468,0.00087743474,0.0003725148,0.000036104786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034555435,0.0007768397,0.022072839,0.0064828577,0.0011673572,0.000038339604,0.33267424,0.025083315,0.00017966879,0.33576003,0.054418545,0.22100042],"study_design_scores_gemma":[0.0021951448,0.0003183576,0.0007770055,0.00035159645,0.000019177653,0.0000691323,0.0012940161,0.97999287,0.00007590037,0.0011295527,0.013256481,0.0005207961],"about_ca_topic_score_codex":0.000022187027,"about_ca_topic_score_gemma":0.0000028346317,"teacher_disagreement_score":0.9549095,"about_ca_system_score_codex":0.000052396164,"about_ca_system_score_gemma":0.000052576455,"threshold_uncertainty_score":0.9999424},"labels":[],"label_agreement":null},{"id":"W3012040074","doi":"10.4230/lipics.stacs.2020.16","title":"Existential Length Universality","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Winnipeg","funders":"","keywords":"Combinatorics; Mathematics; Universality (dynamical systems); Discrete mathematics; Bounded function; Upper and lower bounds; PSPACE; Exponential function; Binary number; Computational complexity theory; Algorithm; Arithmetic","score_opus":0.023378349384035317,"score_gpt":0.23238747961975506,"score_spread":0.20900913023571974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3012040074","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09820153,0.000048554837,0.87614346,0.0033163,0.0013679025,0.00097352866,0.00038735682,0.0010784303,0.018482966],"genre_scores_gemma":[0.9568504,0.000029612349,0.036144,0.0061832913,0.00032195845,0.000030701944,0.00019828125,0.000038632224,0.0002031002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99766016,0.00005125679,0.00078312407,0.00035317708,0.00047683978,0.0006754466],"domain_scores_gemma":[0.9982437,0.00011033602,0.0003277309,0.0007886674,0.0001618689,0.00036773557],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041789602,0.0003471376,0.0004042411,0.00012323681,0.00030346622,0.00048147867,0.0019255523,0.0001676198,0.00006628919],"category_scores_gemma":[0.000084057356,0.00032005773,0.0003020683,0.00043062976,0.0001149981,0.0022873175,0.00077279436,0.0003465574,0.000339594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004154183,0.0007849721,0.0031452796,0.0016346897,0.0006636186,0.00007577738,0.06325292,0.00039332442,0.00064780435,0.75064826,0.061793126,0.11654483],"study_design_scores_gemma":[0.005376058,0.0005881648,0.00081148394,0.00010474567,0.000062021936,0.000067574256,0.0027561954,0.47774062,0.0028980807,0.004060381,0.5043105,0.0012241902],"about_ca_topic_score_codex":0.000014346693,"about_ca_topic_score_gemma":0.000002937032,"teacher_disagreement_score":0.8586489,"about_ca_system_score_codex":0.000078259305,"about_ca_system_score_gemma":0.00008632071,"threshold_uncertainty_score":0.99992514},"labels":[],"label_agreement":null},{"id":"W3012136308","doi":"10.4230/lipics.cp.2022.15","title":"Constraint Acquisition Based on Solution Counting","year":2022,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Constraint (computer-aided design); Computer science; Information retrieval; Mathematics; Geometry","score_opus":0.014764384835088212,"score_gpt":0.2674246517087655,"score_spread":0.25266026687367726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3012136308","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010088177,0.000034591536,0.9693193,0.0016517111,0.004387522,0.0015366856,0.0009796253,0.00082473725,0.011177676],"genre_scores_gemma":[0.8401523,0.000019275703,0.14800043,0.005206248,0.00068167225,0.00063078414,0.0047861403,0.00010533945,0.0004177868],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957771,0.00015986306,0.0013163972,0.00066493225,0.0011730628,0.00090867816],"domain_scores_gemma":[0.9965472,0.000277828,0.0011642834,0.0015084986,0.00029280054,0.00020933857],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017470506,0.0006774953,0.00065173407,0.00056992756,0.00090260594,0.0010856963,0.0020791197,0.00041374564,0.00018934613],"category_scores_gemma":[0.00013936148,0.00068495417,0.0005171448,0.00031703143,0.00011941913,0.0006694709,0.0019047619,0.002146986,0.00010788996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054189033,0.0031462233,0.008542947,0.009586899,0.00097554707,0.00012439533,0.025141865,0.52461475,0.000110505374,0.09496788,0.035648104,0.29659897],"study_design_scores_gemma":[0.001550953,0.0003114344,0.0003678951,0.00036116372,0.000033120807,0.000023861696,0.0002176357,0.95774186,0.0000716423,0.0011320633,0.037450116,0.0007382289],"about_ca_topic_score_codex":0.000054250475,"about_ca_topic_score_gemma":0.0000032367734,"teacher_disagreement_score":0.8300641,"about_ca_system_score_codex":0.00049927545,"about_ca_system_score_gemma":0.0003549874,"threshold_uncertainty_score":0.99995124},"labels":[],"label_agreement":null},{"id":"W3013273637","doi":"10.4230/lipics.stacs.2020.40","title":"Succinct Population Protocols for Presburger Arithmetic","year":2020,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Presburger arithmetic; Remainder; Population; Protocol (science); Quantifier (linguistics); Computer science; Discrete mathematics; Fragment (logic); Mathematics; Decidability; Arithmetic; Programming language","score_opus":0.046122456538243706,"score_gpt":0.3144925250052844,"score_spread":0.2683700684670407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013273637","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038885097,0.000074301104,0.9355573,0.0009735654,0.0027358783,0.050185513,0.0009280204,0.00093150215,0.0047253766],"genre_scores_gemma":[0.5381449,0.00004523351,0.35051832,0.0030877315,0.002717877,0.096272185,0.006813789,0.0003626368,0.002037353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99496377,0.00008916665,0.0020481125,0.00093129155,0.0007809144,0.0011867424],"domain_scores_gemma":[0.99519145,0.00032145536,0.0014446593,0.0018734107,0.00072176394,0.00044726764],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010201861,0.000961978,0.0012541256,0.00038776037,0.00048741943,0.0016433729,0.0032217174,0.0008332137,0.000024594661],"category_scores_gemma":[0.0005513688,0.0008500388,0.00093213125,0.0003620118,0.0000877135,0.0014572515,0.002621062,0.0010498802,0.00013572778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001719299,0.0039626984,0.044102956,0.055108264,0.003094548,0.00005615735,0.0701377,0.004317855,0.00014326368,0.45580387,0.18348393,0.17806944],"study_design_scores_gemma":[0.0056701447,0.00090178655,0.0048253536,0.0013153647,0.00019088943,0.00005159946,0.00018111487,0.65474063,0.00077007053,0.05543941,0.27350238,0.0024112542],"about_ca_topic_score_codex":0.00004116959,"about_ca_topic_score_gemma":0.000020503989,"teacher_disagreement_score":0.6504228,"about_ca_system_score_codex":0.00032272964,"about_ca_system_score_gemma":0.00034494392,"threshold_uncertainty_score":0.999395},"labels":[],"label_agreement":null},{"id":"W3013325312","doi":"10.4230/lipics.icdt.2020.24","title":"Reverse Prevention Sampling for Misinformation Mitigation in Social Networks","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Misinformation; Scalability; Computer science; Limiting; Set (abstract data type); Social network (sociolinguistics); Work (physics); Sampling (signal processing); Theoretical computer science; Algorithm; Computer security; Social media; Telecommunications; Engineering; World Wide Web","score_opus":0.0317130336257738,"score_gpt":0.28072222779172823,"score_spread":0.24900919416595443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013325312","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037556928,0.000014559236,0.959629,0.0008891687,0.00037289786,0.0009838477,0.00004073663,0.00014239798,0.00037043655],"genre_scores_gemma":[0.953278,0.0000069897646,0.043767206,0.0017122612,0.0004081361,0.00009281489,0.00066814676,0.000020427706,0.00004599494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99750316,0.000036720645,0.0013194357,0.00025259025,0.00034016202,0.00054794614],"domain_scores_gemma":[0.9987237,0.00011680842,0.0006043145,0.00016925647,0.00026487978,0.00012102669],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00074271427,0.00027026222,0.0003886533,0.00018811873,0.00033760018,0.0004528291,0.00067564606,0.00022235028,0.000009770605],"category_scores_gemma":[0.00013390102,0.00027268595,0.00035466184,0.00045634687,0.00003444418,0.0023394227,0.00016223526,0.00030494403,0.00002527811],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052067894,0.000509617,0.001656534,0.0022446038,0.00051031297,0.0000039328297,0.13887101,0.19127886,0.00006048146,0.4994127,0.026281275,0.13864999],"study_design_scores_gemma":[0.0017761608,0.00014543018,0.00017986908,0.00010079091,0.000027984534,0.000003589266,0.0011482304,0.98331684,0.000051238985,0.00017326654,0.012776708,0.00029986852],"about_ca_topic_score_codex":0.0000030850324,"about_ca_topic_score_gemma":0.000019671983,"teacher_disagreement_score":0.91586185,"about_ca_system_score_codex":0.00013190716,"about_ca_system_score_gemma":0.000057617457,"threshold_uncertainty_score":0.9999725},"labels":[],"label_agreement":null},{"id":"W3013736025","doi":"10.4230/lipics.stacs.2020.15","title":"The Tandem Duplication Distance Is NP-Hard","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Gene duplication; Tandem exon duplication; Tandem; Edit distance; Computer science; Genome; Tandem repeat; String (physics); Sequence (biology); Mathematics; Biology; Algorithm; Combinatorics; Computational biology; Genetics; Gene","score_opus":0.021399867699930453,"score_gpt":0.2490937005606947,"score_spread":0.22769383286076422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013736025","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034824677,0.00015878888,0.9835071,0.009142681,0.00059498934,0.00074120634,0.00031388405,0.00026672214,0.001792177],"genre_scores_gemma":[0.7672529,0.00081380224,0.18988372,0.037665483,0.0012749545,0.0005794758,0.0010060633,0.0001263643,0.0013971963],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99778426,0.00002701642,0.0007754162,0.00032684562,0.00053912593,0.000547366],"domain_scores_gemma":[0.9979073,0.00015312062,0.00039543683,0.0010672129,0.00022383421,0.00025314273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035697463,0.0002794819,0.0002600031,0.00004286084,0.0007915246,0.00086368545,0.0021497232,0.00011674107,0.000014785318],"category_scores_gemma":[0.00009142469,0.0001941538,0.00016530637,0.00036192243,0.000095130614,0.0019315858,0.00073796377,0.0003100074,0.0002606299],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020127365,0.00032333625,0.0064739846,0.0005151245,0.00025990908,0.000008111325,0.0296419,0.00019114486,0.00030274264,0.17608753,0.5161504,0.26984456],"study_design_scores_gemma":[0.0007687084,0.00009845273,0.0006263185,0.00003175893,0.000008789503,0.0000097118855,0.00019871445,0.30913967,0.00052834395,0.0010958026,0.6872349,0.00025886527],"about_ca_topic_score_codex":0.0000052481423,"about_ca_topic_score_gemma":0.0000027326278,"teacher_disagreement_score":0.7936233,"about_ca_system_score_codex":0.000062654864,"about_ca_system_score_gemma":0.00006170334,"threshold_uncertainty_score":0.83285385},"labels":[],"label_agreement":null},{"id":"W3013795241","doi":"10.4230/dagrep.9.10.47","title":"Quantum Cryptanalysis (Dagstuhl Seminar 19421)","year":2020,"lang":"en","type":"other","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Illinois at Urbana-Champaign; National Institute of Standards and Technology; Universidad de León; Infineon Technologies; Ruhr-Universität Bochum; Université Paris Diderot; Université de Limoges; Universidad del Atlántico; University of Oxford; Sorbonne Université; University of Waterloo; Universidad Rey Juan Carlos; University of Cincinnati; Royal Holloway, University of London; Kungliga Tekniska Högskolan; Technische Universität Darmstadt; California Institute of Technology; University of South Florida; Immanuel Kant Baltic Federal University; Florida Atlantic University; Institut national de recherche en informatique et en automatique (INRIA); Microsoft","keywords":"Cryptanalysis; Computer science; Computer security; Cryptography","score_opus":0.009593295081138457,"score_gpt":0.2350014193117031,"score_spread":0.22540812423056464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013795241","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028892478,0.0010236041,0.8401135,0.0024670563,0.0045843534,0.0024356837,0.0018920657,0.0031609454,0.14403382],"genre_scores_gemma":[0.018162062,0.0012236865,0.7614091,0.014682579,0.008750619,0.00067709544,0.0050894725,0.003962043,0.18604335],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9942238,0.00011101199,0.0017757467,0.0010766308,0.0012654355,0.001547403],"domain_scores_gemma":[0.995088,0.00022300702,0.001530973,0.0023223436,0.00017826995,0.00065743853],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.00056175195,0.0013832892,0.0017033323,0.0010632414,0.00047338242,0.0010272836,0.004331475,0.00087860145,0.00020084744],"category_scores_gemma":[0.00009079677,0.0012264915,0.001086913,0.0012999793,0.00021535734,0.0005777065,0.0016745647,0.0014421951,0.0008494031],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044131495,0.00036836433,0.0001473406,0.0021849226,0.0014270933,0.000104188905,0.0054713837,0.0005548862,0.000019559631,0.012986246,0.9274579,0.049233977],"study_design_scores_gemma":[0.0010526215,0.00024156878,0.000013720709,0.0005502747,0.00012322183,0.000073385316,0.00012041677,0.36770007,0.000047779264,0.0007730694,0.62823105,0.0010727996],"about_ca_topic_score_codex":0.00008552697,"about_ca_topic_score_gemma":0.000023929915,"teacher_disagreement_score":0.36714518,"about_ca_system_score_codex":0.00014437304,"about_ca_system_score_gemma":0.00023229963,"threshold_uncertainty_score":0.99992853},"labels":[],"label_agreement":null},{"id":"W3013871422","doi":"10.4230/dagrep.9.9.135","title":"Comparative Theory for Graph Polynomials (Dagstuhl Seminar 19401)","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Birkbeck, University of London; Royal Holloway, University of London; National Research University Higher School of Economics; Universität des Saarlandes; Centre National de la Recherche Scientifique; University of Waterloo; Université de Bordeaux; Universiteit van Amsterdam; Monash University; Louisiana State University; Deakin University; U.S. Naval Academy; Durham University; Universiteit Leiden; University of North Texas; University of North Florida; Queen Mary University of London; Seoul National University; University of South Florida; York University; Aix-Marseille Université; Université de Montpellier; Univerzita Karlova v Praze","keywords":"Mathematics; Graph; Computer science; Discrete mathematics","score_opus":0.04844326896163092,"score_gpt":0.32058332757919805,"score_spread":0.2721400586175671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013871422","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034954686,0.0002361824,0.9532499,0.0015217178,0.0006473974,0.0038093335,0.0011344808,0.0005790379,0.0038672942],"genre_scores_gemma":[0.86352414,0.00006838112,0.12756903,0.006046808,0.0004915372,0.0010483173,0.0004852552,0.00012701876,0.00063952385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9952461,0.00019894446,0.0014948952,0.00072134234,0.0008033441,0.0015353395],"domain_scores_gemma":[0.9953964,0.0013495024,0.00065218704,0.0012713755,0.00062429823,0.00070626463],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015976763,0.00071512215,0.0010735058,0.00043382533,0.0007966676,0.00062087877,0.0033184616,0.00027943007,0.00003884193],"category_scores_gemma":[0.000420335,0.0006496554,0.00064890727,0.0010276146,0.00045615438,0.0028737085,0.0010205164,0.0006657724,0.00025408738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021508294,0.0008014465,0.0012119833,0.001770714,0.001151128,0.000018936858,0.06749488,0.0010937005,0.0028127974,0.8459861,0.047564954,0.027942492],"study_design_scores_gemma":[0.022348793,0.005832507,0.00079883623,0.000542614,0.00025495718,0.00017032724,0.016608603,0.2552432,0.05516608,0.25215507,0.3860003,0.004878699],"about_ca_topic_score_codex":0.0000026870878,"about_ca_topic_score_gemma":0.0000034633185,"teacher_disagreement_score":0.8285694,"about_ca_system_score_codex":0.00013104209,"about_ca_system_score_gemma":0.00018387083,"threshold_uncertainty_score":0.99959546},"labels":[],"label_agreement":null},{"id":"W3013877464","doi":"10.4230/lipics.opodis.2019.24","title":"Oblivious Permutations on the Plane","year":2020,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Robot; Permutation (music); Class (philosophy); Computer science; Plane (geometry); Euclidean geometry; Mobile robot; Algorithm; Theoretical computer science; Mathematics; Artificial intelligence; Geometry","score_opus":0.05331678362262645,"score_gpt":0.2853190603340678,"score_spread":0.23200227671144133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013877464","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033800656,0.00004223297,0.94158924,0.023084575,0.0021101835,0.0038907658,0.0015115546,0.0007790805,0.023612335],"genre_scores_gemma":[0.84288645,0.00036127894,0.1164563,0.030282227,0.0007651542,0.0018519608,0.005039892,0.000201854,0.0021548702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965709,0.000116282215,0.0011536607,0.00050285686,0.0009176233,0.00073870836],"domain_scores_gemma":[0.99664146,0.00045151464,0.0006059118,0.0015768773,0.00040542017,0.00031883226],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006725731,0.0005626843,0.00052017486,0.00029882198,0.0006192455,0.0016763841,0.0033209035,0.00037275394,0.00008646809],"category_scores_gemma":[0.00029178176,0.0004155736,0.00037153822,0.000415767,0.00014064589,0.0006939788,0.0020965252,0.0015649162,0.0006770251],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001309245,0.0008592963,0.000448704,0.0021243203,0.00082101714,0.000032916578,0.07285906,0.053562734,0.000023359786,0.6845635,0.17075206,0.013822095],"study_design_scores_gemma":[0.0013664815,0.00034692735,0.00017880392,0.0003329795,0.00003822997,0.00002991972,0.0007502617,0.88510025,0.00014575903,0.015322641,0.0955459,0.00084183074],"about_ca_topic_score_codex":0.000015142353,"about_ca_topic_score_gemma":0.000010069025,"teacher_disagreement_score":0.8395064,"about_ca_system_score_codex":0.00015223528,"about_ca_system_score_gemma":0.0003339176,"threshold_uncertainty_score":0.9998296},"labels":[],"label_agreement":null},{"id":"W3013905686","doi":"10.4230/lipics.opodis.2019.19","title":"Toward Linearizability Testing for Multi-Word Persistent Synchronization Primitives","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Linearizability; Computer science; Word (group theory); Synchronization (alternating current); Programming language; Arithmetic; Computer network; Correctness; Mathematics","score_opus":0.06717344285763832,"score_gpt":0.27320658961995586,"score_spread":0.20603314676231754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013905686","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04160611,0.00007189662,0.95204675,0.0023688313,0.0005679133,0.0019955176,0.00028585334,0.0005003041,0.0005568338],"genre_scores_gemma":[0.62918115,0.0000059194986,0.3645165,0.0053912345,0.0002962686,0.00017632822,0.00037195798,0.00004061711,0.000020013771],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972561,0.000048263104,0.0010001784,0.0005239322,0.00042546802,0.0007460319],"domain_scores_gemma":[0.9975523,0.0003400535,0.00045529532,0.0006099785,0.0007020969,0.0003402845],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003889659,0.00043286177,0.00045820614,0.00013619395,0.00046171056,0.0005052453,0.0014718876,0.00018668851,0.000007549963],"category_scores_gemma":[0.0002822363,0.00038761095,0.000360019,0.0006566557,0.000078208745,0.0014913969,0.00061634794,0.0003219002,0.000038799582],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009957559,0.0027153871,0.05371809,0.02099536,0.0016484048,0.000018166487,0.46128523,0.019030387,0.0017455865,0.023286505,0.0019208951,0.41264024],"study_design_scores_gemma":[0.002693463,0.0006854414,0.0010425771,0.00014011415,0.000060454622,0.0000168894,0.002556939,0.9752992,0.001377167,0.00019643577,0.015386001,0.0005453178],"about_ca_topic_score_codex":0.000021943235,"about_ca_topic_score_gemma":0.000014754758,"teacher_disagreement_score":0.9562688,"about_ca_system_score_codex":0.0001038091,"about_ca_system_score_gemma":0.0001504946,"threshold_uncertainty_score":0.9998576},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"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","score_opus":0.016616981657599762,"score_gpt":0.24280658669256847,"score_spread":0.2261896050349687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3014455327","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081760354,0.00005400921,0.9111961,0.0028991026,0.0005753734,0.0017203339,0.0011660438,0.00026894806,0.00035970222],"genre_scores_gemma":[0.6774178,0.000014720355,0.31955397,0.0019040114,0.00030851088,0.00017717428,0.00046697265,0.000057968122,0.000098852266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99718314,0.000038022703,0.0012082647,0.0004186828,0.00044589085,0.0007059925],"domain_scores_gemma":[0.9977794,0.00016228908,0.00063079223,0.0007440741,0.00042011126,0.0002632756],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000503216,0.00038060432,0.0005699281,0.00022371042,0.00032949634,0.00027561226,0.0014449606,0.00009416576,0.00000451546],"category_scores_gemma":[0.0002079612,0.00033080083,0.00033360577,0.0006364783,0.00012074241,0.0008551753,0.000472593,0.0003333647,0.000021689564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066336425,0.0023482074,0.002806056,0.015628729,0.0017196668,0.00002344952,0.20874795,0.067246325,0.0022062098,0.35328287,0.062444136,0.28288305],"study_design_scores_gemma":[0.0016327404,0.00052997057,0.00018081743,0.00007815306,0.000024288773,0.000023814087,0.00024636058,0.9649373,0.0022200928,0.007906501,0.021801038,0.00041888963],"about_ca_topic_score_codex":0.0000096136255,"about_ca_topic_score_gemma":0.0000053908016,"teacher_disagreement_score":0.897691,"about_ca_system_score_codex":0.000036535246,"about_ca_system_score_gemma":0.00014925278,"threshold_uncertainty_score":0.9999144},"labels":[],"label_agreement":null},{"id":"W3017007515","doi":"10.4230/lipics.cpm.2020.11","title":"Summarizing Diverging String Sequences, with Applications to Chain-Letter Petitions","year":2020,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Automatic summarization; Heuristic; String (physics); Sequence (biology); Computer science; Tree (set theory); Variety (cybernetics); Set (abstract data type); Chain (unit); Algorithm; Theoretical computer science; Mathematics; Combinatorics; Artificial intelligence","score_opus":0.027909060437225013,"score_gpt":0.2671914755954198,"score_spread":0.23928241515819476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3017007515","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014763819,0.000046186735,0.98794484,0.0034819806,0.00070078287,0.0024999513,0.0017882168,0.00044438275,0.0016172501],"genre_scores_gemma":[0.1386376,0.00008109499,0.84530526,0.008035702,0.0011728873,0.0023905912,0.0040628733,0.00011833237,0.0001956451],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9964224,0.000040393115,0.0010631083,0.0008068056,0.0008169532,0.0008503019],"domain_scores_gemma":[0.9966483,0.00013110603,0.00062991015,0.0017507428,0.00036056683,0.00047937216],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003629158,0.000654259,0.00063401356,0.00039732127,0.0007970807,0.0015013408,0.0031042655,0.00029188444,0.000016009883],"category_scores_gemma":[0.000036261114,0.000576004,0.00023458253,0.00054633984,0.00009385972,0.0015199805,0.005318249,0.0011606538,0.00015392365],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044162385,0.001791727,0.009654961,0.014077582,0.0026078827,0.00023296454,0.07605152,0.06404221,0.0010157073,0.51837885,0.11464318,0.19706179],"study_design_scores_gemma":[0.002359087,0.00038996775,0.0006342481,0.0026091384,0.0001588879,0.00009464208,0.0010104566,0.38619298,0.0009824191,0.0074896314,0.5953196,0.002758929],"about_ca_topic_score_codex":0.00006967045,"about_ca_topic_score_gemma":0.000023011184,"teacher_disagreement_score":0.51088923,"about_ca_system_score_codex":0.00024667266,"about_ca_system_score_gemma":0.00024858062,"threshold_uncertainty_score":0.99966913},"labels":[],"label_agreement":null},{"id":"W3021687661","doi":"10.4230/lipics.icalp.2017.93","title":"Subspace-Invariant AC^0 Formulas","year":2017,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Linear subspace; Combinatorics; Mathematics; Invariant (physics); Parity function; Omega; Hamming weight; Subspace topology; Discrete mathematics; Upper and lower bounds; Boolean function; Hamming code; Mathematical analysis; Physics; Pure mathematics; Algorithm; Mathematical physics; Quantum mechanics","score_opus":0.0313715502383439,"score_gpt":0.2874558150757654,"score_spread":0.2560842648374215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021687661","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044149425,0.000065044704,0.91596323,0.003046587,0.003930927,0.0015384958,0.00040872168,0.0006296377,0.030267922],"genre_scores_gemma":[0.81188315,0.00007629106,0.1840866,0.0017647346,0.00049898005,0.00017251268,0.00014993513,0.00006434536,0.001303461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99678904,0.000030621988,0.00097109575,0.00042950455,0.000672154,0.0011075755],"domain_scores_gemma":[0.9954281,0.00014852533,0.00077972707,0.0029770096,0.00031560112,0.00035107607],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00082428515,0.00049322005,0.0005451316,0.00027915192,0.0021019257,0.0024635768,0.004750837,0.000252922,0.000039822793],"category_scores_gemma":[0.00021305545,0.00044564248,0.00043794146,0.00020526076,0.00028838613,0.004620519,0.0017704146,0.0005160811,0.00029267132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015609348,0.0007675586,0.006787698,0.0007588207,0.00046473477,0.00006038767,0.015144942,0.0000998575,0.0001128767,0.8445785,0.021608852,0.10945965],"study_design_scores_gemma":[0.00768445,0.0007983401,0.009038672,0.00039632784,0.00007543004,0.00030555087,0.0007662657,0.5027496,0.0030928727,0.05774924,0.4152245,0.0021187332],"about_ca_topic_score_codex":0.000054789038,"about_ca_topic_score_gemma":0.00007353832,"teacher_disagreement_score":0.7868293,"about_ca_system_score_codex":0.00010227479,"about_ca_system_score_gemma":0.00012172872,"threshold_uncertainty_score":0.99979955},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.037655001637565966,"score_gpt":0.2865085311426028,"score_spread":0.2488535295050368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023180869","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044596087,0.00019428239,0.9399059,0.00088937214,0.002611051,0.0027347414,0.006161914,0.00053618394,0.0023705119],"genre_scores_gemma":[0.86375433,0.00014072112,0.13061447,0.0012598124,0.00034413577,0.0003545152,0.0034368492,0.00008147888,0.000013708711],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952937,0.00007329324,0.00211679,0.0007093874,0.0009326423,0.0008742078],"domain_scores_gemma":[0.99496394,0.00020344133,0.0014190316,0.0024773576,0.0005577845,0.00037844767],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00070912694,0.00077800907,0.0011930744,0.00045673724,0.00022984357,0.0006377449,0.004474314,0.0006460601,0.00003001425],"category_scores_gemma":[0.0001660947,0.0007302937,0.0008419467,0.0006343258,0.00022765737,0.0015888049,0.0051194136,0.0013064614,0.000065994405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048358412,0.0018498388,0.0058932574,0.020897917,0.0015202101,0.000035997793,0.05757065,0.0005507689,0.00019787636,0.8279033,0.044723168,0.038373463],"study_design_scores_gemma":[0.008531822,0.0013553563,0.004914807,0.0022332142,0.0004086888,0.00011603947,0.0021784399,0.42936698,0.0065001342,0.23878002,0.30061698,0.0049975156],"about_ca_topic_score_codex":0.00004590594,"about_ca_topic_score_gemma":0.000018938605,"teacher_disagreement_score":0.8191582,"about_ca_system_score_codex":0.00007618155,"about_ca_system_score_gemma":0.00033119286,"threshold_uncertainty_score":0.9995148},"labels":[],"label_agreement":null},{"id":"W3023400052","doi":"10.4230/lipics.icalp.2020.110","title":"Sensitive Instances of the Constraint Satisfaction Problem","year":2020,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Constraint satisfaction problem; Idempotence; Tuple; Mathematics; Context (archaeology); Subalgebra; Variety (cybernetics); Consistency (knowledge bases); Discrete mathematics; Combinatorics; Algebra over a field; Pure mathematics","score_opus":0.018631219693516422,"score_gpt":0.24485251207343764,"score_spread":0.22622129237992122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023400052","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019967837,0.000021363878,0.9639385,0.0026645935,0.002530564,0.0027341445,0.0011119755,0.00029136855,0.006739689],"genre_scores_gemma":[0.90120435,0.00006352152,0.09736729,0.0009149231,0.00009457943,0.00010001656,0.00018451155,0.000027771695,0.000043052514],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969325,0.00009927643,0.0014429588,0.0004290165,0.0006704547,0.00042576116],"domain_scores_gemma":[0.9966461,0.00014619438,0.0015490182,0.000917471,0.00058670394,0.00015452325],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003879596,0.0004860998,0.0006185361,0.00020101848,0.00028907086,0.00039592237,0.0010283892,0.0004031434,0.000021195667],"category_scores_gemma":[0.00012337613,0.00039159783,0.00045243822,0.00038790028,0.00032333442,0.0008933954,0.0012968675,0.00095773826,0.000021532915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035983062,0.00051086454,0.038562343,0.0084205065,0.0020596394,0.000015067236,0.0925054,0.042806067,0.0008910018,0.38505036,0.009569276,0.41924965],"study_design_scores_gemma":[0.0065220166,0.00041812635,0.05247996,0.0028710165,0.00032762138,0.0002503382,0.0061783264,0.8716562,0.011173632,0.0266973,0.018610327,0.0028151711],"about_ca_topic_score_codex":0.000048689595,"about_ca_topic_score_gemma":0.00013646406,"teacher_disagreement_score":0.8812365,"about_ca_system_score_codex":0.00021230835,"about_ca_system_score_gemma":0.00050579605,"threshold_uncertainty_score":0.9998536},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science","score_opus":0.03198763216395205,"score_gpt":0.25634886082708896,"score_spread":0.2243612286631369,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3034373981","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012788994,0.0001668732,0.9790742,0.0009794871,0.0017754572,0.0016468754,0.0017237428,0.00051185605,0.0013325047],"genre_scores_gemma":[0.3464793,0.0005011112,0.6402795,0.0049792915,0.0012147684,0.00067991944,0.0052356087,0.00021494324,0.0004156059],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996198,0.00005844424,0.0013885691,0.0008305756,0.0006396236,0.0008847945],"domain_scores_gemma":[0.99631953,0.00017599094,0.0008313437,0.0018244826,0.0003129159,0.00053573947],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0004808791,0.00080896355,0.0009452865,0.00029906206,0.00038897293,0.0017001842,0.003011472,0.00059920194,0.000018179187],"category_scores_gemma":[0.000111732545,0.00072269875,0.00034091587,0.00026429683,0.0001342631,0.0012562923,0.008175662,0.0013153732,0.00008261382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00088067935,0.0017197831,0.017494712,0.016996112,0.002260416,0.00021136978,0.07581278,0.0029901932,0.00020253981,0.09018265,0.06544639,0.72580236],"study_design_scores_gemma":[0.0026118408,0.00021869603,0.0017333456,0.00053956296,0.000059677117,0.00007650203,0.00034882664,0.91017056,0.00016327058,0.008003055,0.074856244,0.0012184251],"about_ca_topic_score_codex":0.00008724203,"about_ca_topic_score_gemma":0.000028324135,"teacher_disagreement_score":0.90718037,"about_ca_system_score_codex":0.000109315275,"about_ca_system_score_gemma":0.00023109766,"threshold_uncertainty_score":0.99984604},"labels":[],"label_agreement":null},{"id":"W3036465868","doi":"10.48550/arxiv.2006.10957","title":"When Is Amplification Necessary for Composition in Randomized Query Complexity?","year":2020,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Logarithm; Decision tree; Function (biology); Upper and lower bounds; Mathematics; Combinatorics; Overhead (engineering); Tree (set theory); Discrete mathematics; Computer science; Statistics; Data mining; Mathematical analysis","score_opus":0.06031803637100492,"score_gpt":0.2985062379972715,"score_spread":0.23818820162626658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036465868","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007319637,0.00014137386,0.97243756,0.007202311,0.0021080356,0.0072054947,0.0022358221,0.0004495038,0.00090023543],"genre_scores_gemma":[0.27954572,0.00019558193,0.699079,0.007667136,0.0006130561,0.0035061082,0.009199172,0.00012269868,0.000071571536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99442714,0.00022766239,0.002786753,0.00090871693,0.00074481824,0.00090492726],"domain_scores_gemma":[0.9951174,0.0009087654,0.0015278944,0.0016241225,0.00053852575,0.000283271],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018139327,0.000859042,0.0020505688,0.00073547673,0.00043243752,0.0012520491,0.0031978597,0.00062848255,0.000027417702],"category_scores_gemma":[0.0001884553,0.00087093684,0.001211304,0.00043067362,0.00040606697,0.0015817623,0.0021637853,0.0012487285,0.000053585485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.019947896,0.0024210433,0.000895766,0.016165866,0.0019045279,0.000018912218,0.14241402,0.0017481293,0.000113058864,0.71256566,0.04987927,0.05192587],"study_design_scores_gemma":[0.035793204,0.00009866433,0.0001165992,0.00053534476,0.000075918026,0.000013743381,0.0003348392,0.61243796,0.00029769438,0.3423274,0.0071417643,0.000826855],"about_ca_topic_score_codex":0.00013946898,"about_ca_topic_score_gemma":0.00003209309,"teacher_disagreement_score":0.6106899,"about_ca_system_score_codex":0.0002789103,"about_ca_system_score_gemma":0.0002512586,"threshold_uncertainty_score":0.99978477},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.028446762039231927,"score_gpt":0.2550328808854351,"score_spread":0.22658611884620314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037400974","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2945006,0.000074581396,0.696869,0.00072261126,0.00049265666,0.0014372863,0.0005481251,0.00033410266,0.00502102],"genre_scores_gemma":[0.96022135,0.00003587083,0.036230672,0.00269575,0.000085420295,0.00012434197,0.0005692843,0.000029289646,0.000008037837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968185,0.00003044859,0.0011894014,0.0005349007,0.0005586651,0.0008681059],"domain_scores_gemma":[0.998134,0.000071962124,0.00031103502,0.00097613555,0.00010024873,0.00040662926],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004573976,0.000437916,0.0005695229,0.0002916724,0.00024098465,0.00059850013,0.002248343,0.00016953758,0.000031116346],"category_scores_gemma":[0.000035558376,0.00042498478,0.0003067767,0.00081583206,0.00009127887,0.0036428454,0.001278572,0.0004892638,0.000107619795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012009064,0.0026025022,0.04542636,0.0035185684,0.0006187884,0.00013547459,0.2013653,0.015581158,0.00081087684,0.67525536,0.034584686,0.018899998],"study_design_scores_gemma":[0.004741658,0.00023255477,0.0012188266,0.000120631885,0.000017401659,0.000016949756,0.00102339,0.96996045,0.0007668696,0.0070111854,0.014236014,0.0006540456],"about_ca_topic_score_codex":0.00004717683,"about_ca_topic_score_gemma":0.00003878049,"teacher_disagreement_score":0.9543793,"about_ca_system_score_codex":0.00009813463,"about_ca_system_score_gemma":0.00005315573,"threshold_uncertainty_score":0.9998202},"labels":[],"label_agreement":null},{"id":"W3037488610","doi":"10.4230/lipics.swat.2020.22","title":"Clustering Moving Entities in Euclidean Space","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Cluster analysis; k-medians clustering; Correlation clustering; Disjoint sets; CURE data clustering algorithm; Combinatorics; Canopy clustering algorithm; Mathematics; Single-linkage clustering; Center (category theory); Algorithm; Sequence (biology); Data stream clustering; Euclidean space; Computer science; Statistics","score_opus":0.022118242785892406,"score_gpt":0.23660286487675364,"score_spread":0.21448462209086122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037488610","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032552347,0.0000484992,0.9490835,0.0034331786,0.0010482213,0.0009872139,0.0001598265,0.0004664958,0.01222072],"genre_scores_gemma":[0.78788036,0.000095393414,0.2032972,0.0067200204,0.00044154262,0.00011694946,0.0003910314,0.00007278803,0.0009847305],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977014,0.000026771135,0.0008189608,0.00032610862,0.0004257358,0.0007010123],"domain_scores_gemma":[0.99879867,0.000071422524,0.00025661633,0.0006042504,0.00007182533,0.00019721124],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004334017,0.00031435126,0.00035890812,0.0002584931,0.00018280739,0.000995923,0.0017638346,0.00009008882,0.000024767021],"category_scores_gemma":[0.000090037116,0.00031187094,0.0001442125,0.000505436,0.000054495915,0.0042580185,0.0016038533,0.00030962174,0.0001964386],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038022723,0.001210496,0.06138501,0.00938742,0.0008442262,0.00028641868,0.20852068,0.009577203,0.0004947599,0.27032286,0.08931549,0.34827518],"study_design_scores_gemma":[0.0021193014,0.00016196111,0.0009544196,0.00015596415,0.000013455659,0.000009804066,0.0022981307,0.87884104,0.00030395584,0.0005274585,0.114025205,0.0005892888],"about_ca_topic_score_codex":0.000026334434,"about_ca_topic_score_gemma":0.000032261913,"teacher_disagreement_score":0.8692638,"about_ca_system_score_codex":0.0000759631,"about_ca_system_score_gemma":0.000033930144,"threshold_uncertainty_score":0.99993336},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03339787288379148,"score_gpt":0.2676198671543172,"score_spread":0.2342219942705257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037695460","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008930656,0.000058243528,0.955951,0.028104994,0.00049236655,0.0012529744,0.00044117356,0.0020600676,0.0027085766],"genre_scores_gemma":[0.291193,0.00006154185,0.7008077,0.0067486777,0.00022522805,0.00016331748,0.0006714549,0.000062119,0.00006696801],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966422,0.0000336604,0.0012643725,0.00051921315,0.0007154868,0.0008251028],"domain_scores_gemma":[0.99412763,0.00011639531,0.0005573355,0.004621547,0.00030274448,0.00027435346],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0005569632,0.00042182094,0.0004786222,0.00021857346,0.00031752852,0.0006441103,0.019741552,0.00026667558,0.000036107453],"category_scores_gemma":[0.005973261,0.00039191358,0.00021558875,0.00076491805,0.00013590387,0.0032193991,0.04132275,0.000602368,0.00030696724],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022526665,0.00043368147,0.008652539,0.003293205,0.0005076223,0.000076907825,0.006109662,0.0003304223,0.0007759525,0.03092714,0.86706233,0.08160525],"study_design_scores_gemma":[0.0017920944,0.0003195309,0.00055863487,0.00020382597,0.000022725153,0.00007396035,0.00027223205,0.8406884,0.0015129014,0.011569636,0.14221272,0.0007733284],"about_ca_topic_score_codex":0.0000044316466,"about_ca_topic_score_gemma":0.0000028524287,"teacher_disagreement_score":0.840358,"about_ca_system_score_codex":0.00013596084,"about_ca_system_score_gemma":0.000111546295,"threshold_uncertainty_score":0.99985325},"labels":[],"label_agreement":null},{"id":"W3037891713","doi":"10.4230/lipics.sea.2020.27","title":"Path Query Data Structures in Practice","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":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Data structure; Tree traversal; Path (computing); Pointer (user interface); Theoretical computer science; Data mining; Algorithm; Artificial intelligence","score_opus":0.04467023161662047,"score_gpt":0.3016617124805083,"score_spread":0.25699148086388784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037891713","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021447137,0.00015791686,0.96823674,0.0051792753,0.0008626756,0.0008207044,0.0003934566,0.00019859102,0.002703494],"genre_scores_gemma":[0.70722914,0.00005528642,0.27892673,0.0117254695,0.0003926336,0.000037532765,0.0015657851,0.000023579942,0.00004381262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978562,0.00006280074,0.000799696,0.00037330677,0.00050002703,0.00040795843],"domain_scores_gemma":[0.9981574,0.00027217125,0.00032614573,0.000833169,0.0002208818,0.0001902695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005785422,0.00024126281,0.00026475344,0.00017452502,0.0001632184,0.00047219658,0.0017721081,0.00011765666,0.000012438145],"category_scores_gemma":[0.00061380444,0.00022839388,0.00006932009,0.0006479268,0.000035258654,0.004695833,0.0009599432,0.00033783377,0.000074854695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007476202,0.0012115607,0.0072324583,0.002070596,0.00058502157,0.00012333672,0.06717319,0.03407129,0.00044644467,0.48109528,0.16582206,0.23942113],"study_design_scores_gemma":[0.0017893479,0.00019069524,0.001256623,0.00004087284,0.000020904716,0.000056917703,0.0007341339,0.73767877,0.00027265548,0.0017788918,0.2557616,0.00041858247],"about_ca_topic_score_codex":0.000015091861,"about_ca_topic_score_gemma":0.000008751254,"teacher_disagreement_score":0.7036075,"about_ca_system_score_codex":0.000055993074,"about_ca_system_score_gemma":0.00016849971,"threshold_uncertainty_score":0.9313632},"labels":[],"label_agreement":null},{"id":"W3038043972","doi":"10.4230/lipics.icalp.2020.87","title":"On the Complexity of Zero Gap MIP*","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Decidability; Complexity class; Class (philosophy); Connection (principal bundle); Discrete mathematics; Mathematical proof; Computability; PSPACE; Mathematics; Quantum complexity theory; Set (abstract data type); Core (optical fiber); Complement (music); Computer science; Operator (biology); Hierarchy; Computational complexity theory; Quantum; Time complexity; Quantum computer; Algorithm","score_opus":0.09277187158679966,"score_gpt":0.26941137540116816,"score_spread":0.1766395038143685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3038043972","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087551154,0.000029250492,0.88959926,0.011385616,0.00094939297,0.0018285586,0.00036567406,0.00039320544,0.007897879],"genre_scores_gemma":[0.94508094,0.000005090207,0.04843164,0.0061828755,0.000118579366,0.000057562236,0.000058709495,0.000027667458,0.000036922727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967081,0.000107757456,0.0012574405,0.00040450244,0.00082435797,0.00069787086],"domain_scores_gemma":[0.9968132,0.00061277574,0.0005390194,0.0013875015,0.00036478552,0.00028271443],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007680447,0.0004295144,0.0005954069,0.00012006306,0.00032748157,0.00031711572,0.0030637693,0.00015127825,0.00006950998],"category_scores_gemma":[0.00040607725,0.00030856396,0.000389495,0.00063434464,0.0005273228,0.00083142036,0.0012596521,0.00057248265,0.00021058413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016843507,0.00077007886,0.0018867737,0.0008008429,0.00023214461,0.000007254707,0.023091601,0.0012075315,0.00011103204,0.93105346,0.024255065,0.016415754],"study_design_scores_gemma":[0.0028252848,0.0013909208,0.001991518,0.00012389112,0.000036919388,0.00003494911,0.0006524571,0.8401401,0.0032031457,0.11977242,0.028959526,0.000868876],"about_ca_topic_score_codex":0.000019149038,"about_ca_topic_score_gemma":0.000006525486,"teacher_disagreement_score":0.8575298,"about_ca_system_score_codex":0.00009415443,"about_ca_system_score_gemma":0.00010867319,"threshold_uncertainty_score":0.99993664},"labels":[],"label_agreement":null},{"id":"W3038075884","doi":"10.4230/lipics.socg.2020.65","title":"Dense Graphs Have Rigid Parts","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":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Hungarian Scientific Research Fund; European Commission","keywords":"Embedding; Combinatorics; Line graph; Infinitesimal; Discrete mathematics; Graph; Mathematics; Connection (principal bundle); Graph embedding; Upper and lower bounds; Computer science; Geometry; Artificial intelligence","score_opus":0.02509235238038038,"score_gpt":0.2507870625630595,"score_spread":0.22569471018267911,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3038075884","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07811923,0.000079859936,0.913094,0.002811255,0.0009600873,0.00085050263,0.0001541952,0.0003682765,0.0035626255],"genre_scores_gemma":[0.9314845,0.00002628666,0.059858482,0.0076564485,0.00027458082,0.00006872927,0.00038425726,0.000025428195,0.00022125333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99776447,0.000038590177,0.00081234943,0.00032461828,0.00053038757,0.0005295882],"domain_scores_gemma":[0.998442,0.00012731944,0.00029535103,0.00047251265,0.0003089419,0.00035386469],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032063416,0.00030705062,0.00031283792,0.00019732324,0.00034556774,0.00051561365,0.0009117427,0.00013343796,0.000025604062],"category_scores_gemma":[0.00011846202,0.00029198447,0.0002371264,0.00051364204,0.000059367565,0.0017274646,0.00034458173,0.00026043493,0.000267644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051332917,0.0011912658,0.016151031,0.0017250871,0.00085512287,0.00011452447,0.07696729,0.027106928,0.0010321555,0.5375199,0.1936247,0.14319867],"study_design_scores_gemma":[0.0026808456,0.00047349863,0.001288267,0.00005202751,0.000033273784,0.0000947528,0.00040147224,0.70227265,0.003117095,0.0076226015,0.28120288,0.000760601],"about_ca_topic_score_codex":0.0000039146917,"about_ca_topic_score_gemma":0.0000057838415,"teacher_disagreement_score":0.8533653,"about_ca_system_score_codex":0.000048016565,"about_ca_system_score_gemma":0.00009939027,"threshold_uncertainty_score":0.9999532},"labels":[],"label_agreement":null},{"id":"W3042622665","doi":"10.4230/lipics.icalp.2022.71","title":"Downsampling for Testing and Learning in Product Distributions","year":2020,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Upsampling; Property testing; Monotonic function; Polynomial; Product (mathematics); Mathematics; Distribution (mathematics); Constant (computer programming); Regular polygon; Connection (principal bundle); Combinatorics; Discrete mathematics; Sample complexity; Time complexity; Function (biology); Sample (material); Algorithm; Computer science; Mathematical analysis; Artificial intelligence","score_opus":0.03634888266614139,"score_gpt":0.2872981621214975,"score_spread":0.2509492794553561,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3042622665","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031365793,0.0001244776,0.96133184,0.0024574725,0.0009825607,0.0021270164,0.00055251754,0.0005801023,0.00047821118],"genre_scores_gemma":[0.41190577,0.000030984895,0.5849838,0.00035822944,0.00061945454,0.00058334175,0.0013059344,0.00006648691,0.00014599522],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99678534,0.00008106843,0.0012289349,0.00072016503,0.0003508934,0.00083358586],"domain_scores_gemma":[0.9972839,0.0007604569,0.0007250404,0.00067324244,0.00032559587,0.00023176757],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001280581,0.00055637985,0.0007148709,0.00029184646,0.0006358588,0.0010549481,0.0012243211,0.00026966698,0.0000020806056],"category_scores_gemma":[0.0027452735,0.0005469152,0.00021572913,0.00041451104,0.00008287176,0.0006758512,0.002062135,0.002236225,0.000012124403],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002237496,0.0008533115,0.08695613,0.020434933,0.00069476716,0.000035964455,0.055873714,0.085849866,0.00028846512,0.031249495,0.0036514022,0.7138882],"study_design_scores_gemma":[0.0014375086,0.00020510425,0.002312095,0.00064398034,0.00003423166,0.000035745576,0.00025269078,0.9674003,0.00009640245,0.0048167477,0.02202457,0.0007406035],"about_ca_topic_score_codex":0.000080052414,"about_ca_topic_score_gemma":0.00000918062,"teacher_disagreement_score":0.88155043,"about_ca_system_score_codex":0.00013577381,"about_ca_system_score_gemma":0.00022032818,"threshold_uncertainty_score":0.99998206},"labels":[],"label_agreement":null},{"id":"W3048149130","doi":"10.4230/lipics.icalp.2020.118","title":"A Recipe for Quantum Graphical Languages","year":2020,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Future Earth","funders":"","keywords":"Recipe; Computer science; Programming language; Theoretical computer science; History","score_opus":0.02432635080196455,"score_gpt":0.30179505609517104,"score_spread":0.2774687052932065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3048149130","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09368352,0.00011821413,0.86408746,0.0033870072,0.0017048293,0.00675367,0.02479523,0.00039069122,0.0050793686],"genre_scores_gemma":[0.97324985,0.000029723195,0.0103869485,0.0007653844,0.0013250734,0.0030238158,0.010880102,0.00015267829,0.00018642434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99692464,0.000026091042,0.0013422861,0.0005423631,0.00037336114,0.0007912501],"domain_scores_gemma":[0.99736536,0.00017892239,0.0008016921,0.00097332604,0.0003407997,0.00033992433],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037014042,0.0006878985,0.0008750287,0.0002450466,0.00038418724,0.00043030316,0.001059967,0.0004104865,0.00011380197],"category_scores_gemma":[0.000040600415,0.0006557797,0.00095255027,0.00026120123,0.000085678905,0.0002380366,0.00077626505,0.0010535629,0.00011286941],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012261022,0.00041578352,0.000700931,0.001143799,0.0006045267,8.591348e-7,0.0023516936,0.000042100168,0.00009561362,0.967555,0.020647386,0.0063196835],"study_design_scores_gemma":[0.003126641,0.00029885911,0.00011967703,0.0004164503,0.00036920226,0.0000038383823,0.0031023312,0.143756,0.0008280689,0.51798564,0.3285163,0.0014770117],"about_ca_topic_score_codex":0.000052997075,"about_ca_topic_score_gemma":0.00000522907,"teacher_disagreement_score":0.8795663,"about_ca_system_score_codex":0.0000570404,"about_ca_system_score_gemma":0.00018499939,"threshold_uncertainty_score":0.9995893},"labels":[],"label_agreement":null},{"id":"W3082438618","doi":"10.4230/lipics.esa.2020.69","title":"On the Computational Complexity of Linear Discrepancy","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rounding; Mathematics; Matrix (chemical analysis); Computational complexity theory; Exponential function; Constant (computer programming); Row and column spaces; Bounded function; Linear system; Discrete mathematics; Approximation algorithm; Linear programming; Algorithm; Combinatorics; Applied mathematics; Row; Computer science; Mathematical analysis","score_opus":0.1430395375713346,"score_gpt":0.3338956725879022,"score_spread":0.1908561350165676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082438618","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26314673,0.000006090891,0.6956405,0.010574648,0.00019870438,0.0025689304,0.0010694849,0.0002452319,0.026549673],"genre_scores_gemma":[0.80339557,0.0000029414293,0.19148697,0.004148074,0.0001357661,0.00012357507,0.00048502462,0.000050598286,0.0001714982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99766845,0.00005600892,0.0012469648,0.00015420553,0.0005922233,0.00028216827],"domain_scores_gemma":[0.9976815,0.00091569376,0.0005758673,0.00035616872,0.00033182336,0.00013895739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004662939,0.00026914422,0.0004450233,0.00006610472,0.00023603496,0.00007382116,0.00044209624,0.00011329957,0.00049843156],"category_scores_gemma":[0.0013205479,0.00017051854,0.00026675212,0.00022510179,0.00024369637,0.00030600122,0.00010734282,0.0003215782,0.00016180146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009363189,0.00027386952,0.000041232655,0.0007095022,0.00007139244,2.0760993e-7,0.006505723,0.00005562163,0.000011371436,0.9821233,0.009832443,0.00028169437],"study_design_scores_gemma":[0.0010898922,0.00027850945,0.000051505056,0.00014043206,0.000034345896,0.00000435376,0.0014178271,0.40466094,0.0008960348,0.587601,0.0036086724,0.00021646063],"about_ca_topic_score_codex":0.000002511019,"about_ca_topic_score_gemma":0.0000026587004,"teacher_disagreement_score":0.5402488,"about_ca_system_score_codex":0.000037674126,"about_ca_system_score_gemma":0.00004258986,"threshold_uncertainty_score":0.69535446},"labels":[],"label_agreement":null},{"id":"W3082716383","doi":"10.4230/lipics.approx/random.2020.18","title":"On Testing and Robust Characterizations of Convexity","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Convexity; Computer science","score_opus":0.14247473325074667,"score_gpt":0.33722900295259484,"score_spread":0.19475426970184817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082716383","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1676882,0.000011648409,0.822312,0.0010411222,0.00017857211,0.0021794073,0.0013483646,0.00028565153,0.004955057],"genre_scores_gemma":[0.37508842,0.000039275263,0.6222095,0.0016063971,0.00015909832,0.0001375085,0.00038548408,0.00012413123,0.000250233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980186,0.000033829165,0.0009285489,0.00019795012,0.00042624088,0.00039482283],"domain_scores_gemma":[0.99751663,0.00092038634,0.00048102083,0.00032283316,0.00051554077,0.00024361546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028336167,0.000255171,0.00043222687,0.00014783419,0.00021452174,0.000091364236,0.00030025793,0.00013347312,0.000078083736],"category_scores_gemma":[0.003513219,0.0002385045,0.00008261265,0.000421271,0.00016680255,0.0005896303,0.00021206618,0.00033460144,0.000025362866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003260192,0.005902851,0.058665078,0.037021946,0.0023334962,0.000051430645,0.12110305,0.070407085,0.0059603346,0.5763873,0.023648899,0.09525836],"study_design_scores_gemma":[0.004697555,0.0008447569,0.0009428853,0.0003490525,0.00006618931,0.000024400086,0.0015245047,0.9744926,0.0028984665,0.0109257735,0.0025618353,0.0006719577],"about_ca_topic_score_codex":0.000001993913,"about_ca_topic_score_gemma":0.0000010352753,"teacher_disagreement_score":0.9040855,"about_ca_system_score_codex":0.000044509994,"about_ca_system_score_gemma":0.000061561586,"threshold_uncertainty_score":0.9725931},"labels":[],"label_agreement":null},{"id":"W3082756794","doi":"10.4230/lipics.itcs.2021.32","title":"Bounds on the QAC$^0$ Complexity of Approximating Parity","year":2020,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Toffoli gate; Upper and lower bounds; Electronic circuit; Parity (physics); Qubit; Mathematics; Physics; Discrete mathematics; Quantum; Combinatorics; Quantum gate; Quantum mechanics; Mathematical analysis","score_opus":0.0579366486334525,"score_gpt":0.2758983058560783,"score_spread":0.21796165722262578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082756794","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1481175,0.00006524517,0.8322081,0.0076844334,0.002499097,0.0026538263,0.0012328713,0.00060771656,0.004931204],"genre_scores_gemma":[0.8043574,0.000013306729,0.19210747,0.0025104438,0.00041686857,0.0001272493,0.00037037386,0.000061785,0.00003509775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953706,0.00016494385,0.0019450944,0.00064375723,0.0010195115,0.0008560466],"domain_scores_gemma":[0.99497294,0.00057392224,0.001743423,0.00212248,0.00034666277,0.00024054361],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0013726121,0.0007713476,0.0010880802,0.00021279955,0.000668664,0.0009039167,0.0044458965,0.00041528622,0.000011594008],"category_scores_gemma":[0.0003547558,0.0005557802,0.0006953281,0.0004212023,0.0004728296,0.0003306949,0.0047209924,0.0023361025,0.00004248416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026130793,0.0016278726,0.0016070487,0.011663879,0.001552654,0.000024474799,0.08102262,0.027769465,0.000097385535,0.7843111,0.020433772,0.069628425],"study_design_scores_gemma":[0.0007293167,0.00026527277,0.00047286446,0.0006328529,0.000034266475,0.000020746564,0.0002681498,0.93598086,0.00054342847,0.054258958,0.0061752344,0.00061805994],"about_ca_topic_score_codex":0.00004866764,"about_ca_topic_score_gemma":0.000007180254,"teacher_disagreement_score":0.9082114,"about_ca_system_score_codex":0.00011225348,"about_ca_system_score_gemma":0.0002475869,"threshold_uncertainty_score":0.99996555},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; 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","score_opus":0.015175484887956319,"score_gpt":0.22441194505017908,"score_spread":0.20923646016222278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082819694","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07789553,0.00004760161,0.9070956,0.009553247,0.0005480498,0.0008080664,0.00007237223,0.00034017608,0.0036393302],"genre_scores_gemma":[0.8566712,0.000016707625,0.13238424,0.009824298,0.00041418572,0.000068614696,0.00030170352,0.00004013907,0.0002789132],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785405,0.00003279748,0.00069549854,0.000332284,0.00057615334,0.0005092258],"domain_scores_gemma":[0.99848986,0.000081930026,0.00029991395,0.00046010528,0.00032750954,0.0003407009],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028750722,0.00032223453,0.00031896395,0.00018512779,0.0002680377,0.00047474063,0.000903883,0.00010777515,0.000026476975],"category_scores_gemma":[0.00007554987,0.00026358507,0.00014317369,0.00069138163,0.000036354963,0.0019177574,0.00029518004,0.00025723848,0.00025863026],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015335518,0.0016308379,0.01319197,0.0028161332,0.001672733,0.00014348642,0.1058587,0.050981432,0.002814268,0.36458096,0.18046032,0.2743156],"study_design_scores_gemma":[0.005174594,0.0012792028,0.0010293622,0.00012513442,0.000052056148,0.00010655339,0.0008077822,0.53373516,0.007439925,0.0011472782,0.44800666,0.0010962675],"about_ca_topic_score_codex":0.0000030588933,"about_ca_topic_score_gemma":0.000005409534,"teacher_disagreement_score":0.7787757,"about_ca_system_score_codex":0.00005729935,"about_ca_system_score_gemma":0.000115324925,"threshold_uncertainty_score":0.99998164},"labels":[],"label_agreement":null},{"id":"W3090935379","doi":"10.4230/lipics.fun.2021.10","title":"Computational Fun with Sturdy and Flimsy Numbers","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Base (topology); Mathematics; Natural number; Computer science; Theoretical computer science; Arithmetic; Discrete mathematics; Algorithm","score_opus":0.015259475496861529,"score_gpt":0.2268073120333851,"score_spread":0.2115478365365236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3090935379","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11246521,0.000046842582,0.8799068,0.0031209872,0.00039840935,0.0011883226,0.00017694318,0.00047974987,0.0022167475],"genre_scores_gemma":[0.7136827,0.000007689769,0.2817438,0.0040947706,0.00017248734,0.00006231632,0.00015618665,0.0000363243,0.000043695873],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971152,0.00005124553,0.00087323267,0.00052365864,0.00074289745,0.00069375127],"domain_scores_gemma":[0.99795055,0.00028783438,0.00033480563,0.00058488385,0.00036542604,0.00047647406],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038389038,0.00045862916,0.00051678956,0.0001360071,0.00035992602,0.0007148219,0.0012018721,0.00014488293,0.000023041812],"category_scores_gemma":[0.000079059784,0.00038696133,0.00014303497,0.00053892384,0.00022826172,0.001786483,0.0008611431,0.00041637907,0.00009491999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013875135,0.0028028432,0.14681596,0.0055578044,0.0021989367,0.0002024586,0.21979588,0.080947325,0.000082817896,0.20935895,0.03394216,0.29690737],"study_design_scores_gemma":[0.0040499344,0.0009471966,0.00556109,0.00006300425,0.00003644252,0.00018048052,0.0010662545,0.95729095,0.00007945239,0.0034585022,0.02644883,0.0008178853],"about_ca_topic_score_codex":0.000014016607,"about_ca_topic_score_gemma":0.0000102431695,"teacher_disagreement_score":0.8763436,"about_ca_system_score_codex":0.00009481129,"about_ca_system_score_gemma":0.0001390446,"threshold_uncertainty_score":0.9998582},"labels":[],"label_agreement":null},{"id":"W3091285509","doi":"10.4230/lipics.types.2019.9","title":"Is Impredicativity Implicitly Implicit","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Consistency (knowledge bases); Recursion (computer science); Computer science; Focus (optics); Type (biology); Calculus (dental); Algorithm; Theoretical computer science; Artificial intelligence","score_opus":0.02894255553916048,"score_gpt":0.26671360330542876,"score_spread":0.23777104776626828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091285509","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021453816,0.000080581514,0.9608369,0.003095829,0.00089420244,0.0015404206,0.00014269204,0.00078492076,0.011170638],"genre_scores_gemma":[0.9840176,0.000018810284,0.008018592,0.007094328,0.00035178597,0.00015028969,0.00012399531,0.00003979389,0.000184794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967198,0.000045296405,0.0011268617,0.00049988914,0.00061967195,0.0009885054],"domain_scores_gemma":[0.99742997,0.000093423674,0.0005615637,0.0010888273,0.00027418163,0.0005520472],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005004775,0.0004668401,0.00059102033,0.00013364124,0.00037605903,0.00068303995,0.0022186742,0.00027286136,0.000034808607],"category_scores_gemma":[0.00008731145,0.00039615112,0.00038074268,0.000562053,0.00010691668,0.0017041136,0.00084752345,0.00043705403,0.0006888544],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017137428,0.00086253596,0.040485602,0.0026402073,0.00082793017,0.000032031323,0.09441938,0.000035799538,0.0011495635,0.5286781,0.09733054,0.23336694],"study_design_scores_gemma":[0.004670091,0.0013645872,0.00275469,0.000042205338,0.00007164254,0.00015296649,0.0013121255,0.1294883,0.003920632,0.012853612,0.84176904,0.0016000691],"about_ca_topic_score_codex":0.00006217873,"about_ca_topic_score_gemma":0.00000957605,"teacher_disagreement_score":0.9625638,"about_ca_system_score_codex":0.00009019037,"about_ca_system_score_gemma":0.00012161215,"threshold_uncertainty_score":0.999849},"labels":[],"label_agreement":null},{"id":"W3092889289","doi":"10.4230/lipics.socg.2019.15","title":"Preconditioning for the Geometric Transportation Problem","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computational geometry; Logarithm; Euclidean space; Transportation theory; Euclidean geometry; Mathematics; Geometric networks; Mathematical optimization; Dimension (graph theory); Geometric programming; Integer (computer science); Simple (philosophy); Approximation algorithm; Discrete mathematics; Combinatorics; Computer science; Graph theory; Algorithm; Geometry; Mathematical analysis","score_opus":0.013973836162577013,"score_gpt":0.23837965907272265,"score_spread":0.22440582291014563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092889289","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034009725,0.000072960815,0.95906967,0.00053727144,0.0013069414,0.0027172992,0.00049310364,0.00021654343,0.0015764813],"genre_scores_gemma":[0.77250034,0.00004625208,0.22311376,0.0013988635,0.00022862402,0.0008711443,0.0008720804,0.000048525817,0.0009204136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979664,0.00001624896,0.0007855913,0.00026739456,0.0003917411,0.00057264324],"domain_scores_gemma":[0.9980473,0.00053145655,0.00037051213,0.00068385905,0.00027218537,0.00009472125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065904116,0.00026003984,0.00028318938,0.00033634045,0.0005287577,0.0005120636,0.0013341302,0.000121229525,0.00004722797],"category_scores_gemma":[0.000037621376,0.00020103702,0.00031215345,0.0007608465,0.00006684343,0.0019086108,0.000087127846,0.00026311618,0.00009484468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021006181,0.0007990284,0.014470046,0.003186324,0.0008683889,0.000002003582,0.03216456,0.010876251,0.000081968035,0.5925116,0.018854177,0.32597557],"study_design_scores_gemma":[0.0068503222,0.0009856524,0.017200205,0.00028600616,0.000110735935,0.00004421994,0.0016762756,0.6516534,0.001459552,0.034835372,0.2836698,0.0012284649],"about_ca_topic_score_codex":0.000012087243,"about_ca_topic_score_gemma":0.000017875627,"teacher_disagreement_score":0.7384906,"about_ca_system_score_codex":0.000059416034,"about_ca_system_score_gemma":0.000062894396,"threshold_uncertainty_score":0.81980515},"labels":[],"label_agreement":null},{"id":"W3097401090","doi":"10.4230/lipics.icalp.2021.18","title":"Relaxed Locally Correctable Codes with Improved Parameters","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Code word; Mathematics; Decoding methods; Block (permutation group theory); Combinatorics; Constant (computer programming); Discrete mathematics; Block code; List decoding; Algorithm; Computer science; Concatenated error correction code","score_opus":0.009338702257736227,"score_gpt":0.21309815665717333,"score_spread":0.2037594543994371,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3097401090","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14471649,0.000078668796,0.8468881,0.0003711639,0.0009904819,0.0006989388,0.0001164729,0.00046545797,0.00567419],"genre_scores_gemma":[0.7867599,0.00003066251,0.20964588,0.0024453474,0.00006590211,0.00016506911,0.00020824697,0.00005285985,0.0006261158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99744976,0.00007432072,0.0007752465,0.00042271052,0.00042471947,0.0008532341],"domain_scores_gemma":[0.99741787,0.00029872428,0.00034601588,0.001217323,0.00045592317,0.0002641317],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005954437,0.00041673932,0.00048843055,0.00020839086,0.00043875427,0.0008010775,0.0012167182,0.00018158449,0.000028384777],"category_scores_gemma":[0.00011230019,0.00035269975,0.00028323135,0.0008505888,0.00017753438,0.0016864084,0.0004455703,0.0004317456,0.00006363276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032416955,0.003960159,0.02521893,0.0031846466,0.0035538755,0.00034927498,0.062793836,0.002956984,0.004187569,0.6037327,0.026062455,0.2607579],"study_design_scores_gemma":[0.02314669,0.0050981157,0.001808548,0.0016096217,0.0004282484,0.0017500909,0.010921255,0.64602757,0.079515554,0.02764194,0.19654578,0.00550658],"about_ca_topic_score_codex":0.000012224127,"about_ca_topic_score_gemma":0.000043711414,"teacher_disagreement_score":0.6430706,"about_ca_system_score_codex":0.00007455478,"about_ca_system_score_gemma":0.00021337227,"threshold_uncertainty_score":0.9998925},"labels":[],"label_agreement":null},{"id":"W3107440164","doi":"10.4230/darts.6.2.14","title":"Scala with Explicit Nulls (Artifact)","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Scala; Artifact (error); Computer science; Programming language; Code (set theory); Compiler; Artificial intelligence; Java; Set (abstract data type)","score_opus":0.023753708714751277,"score_gpt":0.23508024529519364,"score_spread":0.21132653658044237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3107440164","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02357433,0.000052355834,0.96071255,0.0015318715,0.0006250044,0.0014622995,0.000037177324,0.00068645965,0.011317944],"genre_scores_gemma":[0.97856,0.000009063873,0.017675227,0.002949768,0.0002535651,0.00014586926,0.00008794542,0.000040933344,0.00027765625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99713945,0.000039083694,0.0009075339,0.00041008764,0.0006347138,0.0008691371],"domain_scores_gemma":[0.9979333,0.0000863398,0.00042781804,0.00082968775,0.0002538207,0.000469012],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035941624,0.00043344352,0.00051769236,0.00012231884,0.00031687034,0.00081398035,0.0015784965,0.00018501324,0.000032934786],"category_scores_gemma":[0.000060299444,0.00032453192,0.00021292992,0.00051067735,0.00008859165,0.0018924125,0.0004349722,0.00035535306,0.0007538808],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004724351,0.00095665763,0.031681065,0.002733283,0.0008456127,0.000109081746,0.10333463,0.00042851255,0.00037177638,0.7080655,0.038336102,0.11266536],"study_design_scores_gemma":[0.0074965744,0.0026300568,0.0011531047,0.0001004088,0.00008860345,0.0002579878,0.003438484,0.14165336,0.005699236,0.0042823227,0.83113027,0.0020695846],"about_ca_topic_score_codex":0.000020940382,"about_ca_topic_score_gemma":0.000010812054,"teacher_disagreement_score":0.9549856,"about_ca_system_score_codex":0.00006909097,"about_ca_system_score_gemma":0.00010011089,"threshold_uncertainty_score":0.99992067},"labels":[],"label_agreement":null},{"id":"W3110091335","doi":"10.4230/darts.6.2.10","title":"Blame for Null (Artifact)","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Artifact (error); Blame; Artificial intelligence; Computer science; Mathematics; Psychology; Social psychology","score_opus":0.031812913883906356,"score_gpt":0.2555231901688151,"score_spread":0.22371027628490872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3110091335","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053945086,0.00006299606,0.98351777,0.0018371174,0.001309977,0.0020835286,0.000093958675,0.00057095906,0.0051292046],"genre_scores_gemma":[0.95875657,0.00001159147,0.03536934,0.0042757546,0.00052169414,0.00033372175,0.00021359349,0.000050226863,0.00046753383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99713045,0.000031486103,0.0010681906,0.00039972775,0.00045528548,0.00091484573],"domain_scores_gemma":[0.9979362,0.00015308907,0.00045726137,0.0007362278,0.0003104354,0.0004067687],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005068947,0.0004030652,0.0005229067,0.00011875339,0.0003499813,0.00074246485,0.0016495181,0.00022362235,0.0000232432],"category_scores_gemma":[0.00017535288,0.0003419429,0.00038804073,0.00034591075,0.00008565195,0.0015810389,0.00041994423,0.00027386664,0.00050603825],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002969245,0.0005918848,0.00514228,0.0031741587,0.0005425696,0.000018784067,0.061534032,0.0002182536,0.00030680982,0.75106484,0.072682954,0.104426496],"study_design_scores_gemma":[0.0031891249,0.0008706739,0.00012312231,0.000021475524,0.00003690444,0.000035353736,0.0008775569,0.14257914,0.0018725803,0.0067416513,0.8429293,0.00072308496],"about_ca_topic_score_codex":0.000012308876,"about_ca_topic_score_gemma":0.000007686978,"teacher_disagreement_score":0.95336205,"about_ca_system_score_codex":0.00007501933,"about_ca_system_score_gemma":0.00010221135,"threshold_uncertainty_score":0.99990326},"labels":[],"label_agreement":null},{"id":"W3112211311","doi":"10.4230/lipics.esa.2025.75","title":"An Improved Bound for Plane Covering Paths","year":2020,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Windsor","funders":"Agence Nationale de la Recherche","keywords":"Kernelization; Randomized algorithm; Algorithm; Set cover problem; Upper and lower bounds; Mathematics; Deterministic algorithm; Line (geometry); Cover (algebra); Computational geometry; Monte Carlo method; Combinatorics; Time complexity; Set (abstract data type); Parameterized complexity; Computer science; Geometry; Mathematical analysis","score_opus":0.02555340797288808,"score_gpt":0.28108164930107316,"score_spread":0.2555282413281851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3112211311","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031572796,0.000072363815,0.95908684,0.00055153074,0.0033259292,0.002564836,0.0019980618,0.0004023112,0.00042536578],"genre_scores_gemma":[0.6082856,0.000056556968,0.3740153,0.0030930545,0.001529155,0.0009435551,0.011779271,0.00010328831,0.00019422296],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99669105,0.00004424303,0.0013343161,0.00068891566,0.0005269076,0.0007145968],"domain_scores_gemma":[0.9969864,0.00022303134,0.0008043251,0.0011058653,0.0005106826,0.0003697353],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00065398373,0.00061911857,0.00067354576,0.00031257432,0.00045307036,0.0017021849,0.001996425,0.0004535316,0.000009722519],"category_scores_gemma":[0.00014613105,0.0006403066,0.000401028,0.00027194477,0.00005491667,0.0016831248,0.0011721886,0.0006532314,0.00003841857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002327894,0.003500575,0.0014392106,0.027129982,0.003335149,0.000054339303,0.08577725,0.203707,0.0099488795,0.1958329,0.06411397,0.40283287],"study_design_scores_gemma":[0.0019507064,0.0005562308,0.00015108257,0.00013156515,0.00005137736,0.000023747802,0.00015482605,0.9294666,0.0019705617,0.010095464,0.05463354,0.0008143033],"about_ca_topic_score_codex":0.00001682588,"about_ca_topic_score_gemma":0.000015323281,"teacher_disagreement_score":0.7257596,"about_ca_system_score_codex":0.00019711778,"about_ca_system_score_gemma":0.00042478772,"threshold_uncertainty_score":0.9996048},"labels":[],"label_agreement":null},{"id":"W3115176827","doi":"10.4230/lipics.isaac.2020.31","title":"Flexible List Colorings in Graphs with Special Degeneracy Conditions","year":2020,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Simon Fraser University","keywords":"Combinatorics; Degeneracy (biology); Treewidth; Mathematics; List coloring; Graph; Degree (music); Discrete mathematics; Pathwidth; Physics; Line graph; Graph power","score_opus":0.03325270291963795,"score_gpt":0.3085065180223265,"score_spread":0.27525381510268854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3115176827","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27790555,0.00013663297,0.66883993,0.0028932649,0.0031264191,0.008306619,0.0037618014,0.0013233791,0.03370641],"genre_scores_gemma":[0.8385564,0.00020086815,0.15150267,0.0023315812,0.0011333309,0.0022208386,0.0029142848,0.00022732378,0.0009127068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949833,0.00011081822,0.0015463039,0.000892349,0.0011020723,0.0013651525],"domain_scores_gemma":[0.9961259,0.00030562637,0.00077216973,0.0017523847,0.00053088786,0.0005130725],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00071303674,0.00083724613,0.0010172243,0.0010946817,0.00046037862,0.0010906705,0.003791787,0.00047362232,0.00006920733],"category_scores_gemma":[0.00016517103,0.000790377,0.0004094896,0.0013645679,0.00045076557,0.002223875,0.0032648987,0.0022383973,0.00015317864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00082915626,0.0008640971,0.008902376,0.0026100285,0.0005392218,0.00017282901,0.014892703,0.006833262,0.00012907587,0.94891393,0.010171385,0.0051419497],"study_design_scores_gemma":[0.016580751,0.002351091,0.005893119,0.0026350217,0.0001770445,0.00030705772,0.0028209905,0.12491043,0.008707221,0.64828444,0.18149412,0.0058387173],"about_ca_topic_score_codex":0.000042729764,"about_ca_topic_score_gemma":0.000112626585,"teacher_disagreement_score":0.5606508,"about_ca_system_score_codex":0.00037779904,"about_ca_system_score_gemma":0.00055197714,"threshold_uncertainty_score":0.9999463},"labels":[],"label_agreement":null},{"id":"W3116404732","doi":"10.4230/lipics.fsttcs.2020.33","title":"Fully Dynamic Sequential and Distributed Algorithms for MAX-CUT","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":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; University of Victoria","keywords":"Algorithm; Computer science; Amortized analysis; Distributed algorithm; Vertex (graph theory); Sublinear function; Sequence (biology); Deterministic algorithm; Computation; Degree (music); Parallel algorithm; Combinatorics; Graph; Mathematics; Theoretical computer science; Data structure","score_opus":0.03316991790132955,"score_gpt":0.27476811442225246,"score_spread":0.2415981965209229,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3116404732","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014283664,0.000072267016,0.97715276,0.0027403347,0.0008770854,0.0013835861,0.00285953,0.0003838939,0.00024687944],"genre_scores_gemma":[0.54169095,0.00009610585,0.44910604,0.00522003,0.0005063456,0.0004156827,0.0027116947,0.00009540576,0.0001577907],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972145,0.000031546977,0.00096951274,0.00048327266,0.00044386525,0.0008572795],"domain_scores_gemma":[0.99816006,0.00017606877,0.00034787678,0.00060560275,0.00028535325,0.00042500618],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037562542,0.00045327688,0.0005305841,0.00015972427,0.000550092,0.0007718033,0.001413892,0.00020446711,0.000015401278],"category_scores_gemma":[0.00011827287,0.00043796585,0.00032244594,0.000467199,0.00020236873,0.0015993085,0.00081416237,0.00036697966,0.000034922552],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012764046,0.0016322182,0.0030302808,0.007432093,0.0021647494,0.000098799006,0.053846266,0.0015777505,0.0009771702,0.31126893,0.047303233,0.5693921],"study_design_scores_gemma":[0.003305072,0.0005489738,0.0002620632,0.00006127882,0.00004550367,0.000072942465,0.00046552208,0.89828086,0.0004196344,0.0063096387,0.089590006,0.0006384966],"about_ca_topic_score_codex":0.000008850104,"about_ca_topic_score_gemma":0.0000120268405,"teacher_disagreement_score":0.8967031,"about_ca_system_score_codex":0.00008342119,"about_ca_system_score_gemma":0.00009492796,"threshold_uncertainty_score":0.99980724},"labels":[],"label_agreement":null},{"id":"W3116777151","doi":"10.4230/lipics.isaac.2020.10","title":"Approximation Algorithms for Generalized Path Scheduling","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Job shop scheduling; Scheduling (production processes); Queue; Path (computing); Algorithm; Computer science; Flow shop scheduling; Longest path problem; Mathematics; Mathematical optimization; Theoretical computer science; Shortest path problem; Graph","score_opus":0.050347934490476275,"score_gpt":0.2875827974597208,"score_spread":0.23723486296924454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3116777151","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026139626,0.00003199564,0.990592,0.002859432,0.00044385862,0.0019960715,0.00020118286,0.00039964708,0.0008618571],"genre_scores_gemma":[0.036360208,0.000041962714,0.95696527,0.0050929906,0.00025659485,0.0004008884,0.00070191,0.000044686894,0.00013546523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974688,0.00004096581,0.0009780132,0.00034566983,0.0004867311,0.0006797966],"domain_scores_gemma":[0.9982133,0.000107863474,0.00036929478,0.00048529502,0.00047335925,0.00035087377],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060213543,0.000312748,0.00038451218,0.00015458197,0.00039992426,0.00072852365,0.0011193705,0.00017135662,0.000020533913],"category_scores_gemma":[0.0002126897,0.00028840883,0.00024706117,0.00044757387,0.00005323317,0.0021443097,0.00033172083,0.00025238708,0.00008228764],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059602724,0.0011762074,0.0011399896,0.006638301,0.00075696374,0.000009717929,0.097179316,0.10341776,0.0014451235,0.5410204,0.03376184,0.21285838],"study_design_scores_gemma":[0.0033010745,0.0002492525,0.0000128968695,0.00004204843,0.000014789336,0.0000063755515,0.0003039594,0.9584905,0.00086166704,0.0013114819,0.035050552,0.0003554183],"about_ca_topic_score_codex":0.0000033071692,"about_ca_topic_score_gemma":8.6898916e-7,"teacher_disagreement_score":0.85507274,"about_ca_system_score_codex":0.00007093733,"about_ca_system_score_gemma":0.00011593005,"threshold_uncertainty_score":0.9999568},"labels":[],"label_agreement":null},{"id":"W3116827133","doi":"10.4230/lipics.isaac.2020.39","title":"Market Pricing for Matroid Rank Valuations","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Division of Mathematical Sciences; Nemzeti Kutatási, Fejlesztési és Innovaciós Alap; Research Institute for Mathematical Sciences; Japan Society for the Promotion of Science; Innovációs és Technológiai Minisztérium; Nemzeti Kutatási Fejlesztési és Innovációs Hivatal; Magyar Tudományos Akadémia","keywords":"Matroid; Weighted matroid; Combinatorics; Rank (graph theory); Graphic matroid; Mathematics; Matroid partitioning; Partition (number theory); Conjecture; Base (topology); Discrete mathematics","score_opus":0.05232919747656014,"score_gpt":0.2469366637237974,"score_spread":0.19460746624723727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3116827133","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22167817,0.00046445706,0.66763985,0.0042849537,0.0029040005,0.006083822,0.0075061535,0.0005394761,0.088899136],"genre_scores_gemma":[0.9848785,0.000022532498,0.010000816,0.0022153887,0.00051655987,0.00033577386,0.00041835709,0.000079469966,0.0015326006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972542,0.000024088285,0.001697382,0.00030943763,0.00009137961,0.0006235384],"domain_scores_gemma":[0.9981347,0.00026241384,0.0008450071,0.000415614,0.00013092124,0.000211343],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016215366,0.0003114302,0.0006701877,0.0002008821,0.00036988998,0.00026356647,0.0005222832,0.00018584904,0.00027104717],"category_scores_gemma":[0.00059974915,0.00033967348,0.00038709588,0.0002614652,0.000061511804,0.00073511974,0.0001110144,0.00023904149,0.00060738996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010160146,0.000492826,0.040582076,0.0055024093,0.0010233143,0.000002544481,0.046003994,0.0013746137,0.00010784765,0.7943325,0.105327144,0.0042347168],"study_design_scores_gemma":[0.008006504,0.00063839415,0.0018091708,0.00018831801,0.00008044556,0.000022906039,0.002946868,0.27911282,0.00033108328,0.024915043,0.6807705,0.0011779479],"about_ca_topic_score_codex":0.000010067487,"about_ca_topic_score_gemma":0.0000028920142,"teacher_disagreement_score":0.76941746,"about_ca_system_score_codex":0.00009922429,"about_ca_system_score_gemma":0.00003155077,"threshold_uncertainty_score":0.9999055},"labels":[],"label_agreement":null},{"id":"W3127870088","doi":"10.4230/lipics.ccc.2021.6","title":"On the Power and Limitations of Branch and Cut","year":2021,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Simons Foundation; National Science Foundation","keywords":"Mathematical proof; Conjecture; Bounded function; Polynomial; Mathematics; Cutting-plane method; Integer (computer science); Exponential function; Integer programming; Algebraic number; Discrete mathematics; Pure mathematics; Algebra over a field; Combinatorics; Computer science; Geometry; Algorithm; Mathematical analysis","score_opus":0.05304068730325925,"score_gpt":0.2892556532147285,"score_spread":0.23621496591146926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3127870088","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36076146,0.00021909649,0.62841815,0.0010125055,0.0013494072,0.0014817952,0.00022689837,0.000102220925,0.0064284364],"genre_scores_gemma":[0.7773548,0.00037674434,0.22094305,0.0009062646,0.000035028912,0.00016785455,0.000115453935,0.000027199192,0.000073606025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977091,0.000119037744,0.0009879813,0.00035815738,0.0004632712,0.00036246216],"domain_scores_gemma":[0.99636,0.0009940614,0.0007156608,0.0014015461,0.00041254642,0.00011615969],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010821981,0.00036996047,0.00046717154,0.00021894413,0.0002571325,0.0006279331,0.0011212649,0.00031610852,0.0000070000806],"category_scores_gemma":[0.0009825836,0.00028756543,0.00016983367,0.00023408738,0.00025055258,0.00084862136,0.0015596378,0.0007155952,0.000007486815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009257251,0.0004438084,0.0010151919,0.0023075906,0.0004955849,0.0000027852025,0.0731677,0.00052352453,0.00016034982,0.8412404,0.002258264,0.07829225],"study_design_scores_gemma":[0.0062478445,0.0019047135,0.031101793,0.004160056,0.0003845082,0.0003225903,0.011299733,0.7566377,0.01731222,0.113697745,0.052969575,0.003961554],"about_ca_topic_score_codex":0.000007921498,"about_ca_topic_score_gemma":0.000008744894,"teacher_disagreement_score":0.7561141,"about_ca_system_score_codex":0.00005416186,"about_ca_system_score_gemma":0.00012203644,"threshold_uncertainty_score":0.9999576},"labels":[],"label_agreement":null},{"id":"W3131743673","doi":"10.4230/lipics.disc.2021.43","title":"Brief Announcement: Fast Graphical Population Protocols","year":2021,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Population; Medicine; Environmental health","score_opus":0.02080968731075352,"score_gpt":0.28884518879494614,"score_spread":0.26803550148419264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3131743673","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022814725,0.000103321014,0.94146407,0.00058181747,0.003153305,0.02480604,0.003045922,0.00065171183,0.0033790946],"genre_scores_gemma":[0.88460964,0.00005507033,0.06398312,0.0020063615,0.000937736,0.029114172,0.018535146,0.0001524179,0.00060630596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99412715,0.00011226481,0.002455553,0.00089128216,0.0013089248,0.0011048486],"domain_scores_gemma":[0.99486846,0.00007084455,0.00139821,0.002409932,0.0008925144,0.00036003676],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00095554226,0.00086450175,0.0011714868,0.0003376609,0.00046360452,0.0030693403,0.0027744346,0.00087649096,0.000023687484],"category_scores_gemma":[0.00009893164,0.00083663774,0.00071178615,0.00062019046,0.00010411145,0.0020927873,0.0023464737,0.0013130377,0.00004611664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000901628,0.009339636,0.10113009,0.05354018,0.0046549127,0.00037181305,0.072417706,0.019656407,0.00031054238,0.37519506,0.09542126,0.26706076],"study_design_scores_gemma":[0.008066329,0.0006212641,0.014511866,0.0065089427,0.00012629462,0.0002417709,0.0011737671,0.5289197,0.00034346833,0.0048348596,0.4306926,0.0039591244],"about_ca_topic_score_codex":0.00012556241,"about_ca_topic_score_gemma":0.00005043813,"teacher_disagreement_score":0.8774809,"about_ca_system_score_codex":0.00030138082,"about_ca_system_score_gemma":0.00029429063,"threshold_uncertainty_score":0.9994084},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; 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","score_opus":0.025036970799697925,"score_gpt":0.29309773481931123,"score_spread":0.2680607640196133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3133750907","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17843771,0.00008858805,0.79634106,0.0054763844,0.001896745,0.0022795522,0.0010274278,0.00041462458,0.014037921],"genre_scores_gemma":[0.9505057,0.00008918678,0.04485586,0.003112164,0.00023311227,0.0001308463,0.0003898039,0.000052135405,0.00063119456],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974833,0.00006699484,0.00067661173,0.00033853002,0.0007307982,0.0007037583],"domain_scores_gemma":[0.9961102,0.0002933359,0.0005691727,0.002641792,0.00019279466,0.00019271573],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011892454,0.00034710832,0.0003452037,0.00015119826,0.002187333,0.0020915242,0.003943301,0.00013819347,0.000036065325],"category_scores_gemma":[0.00027651468,0.00022446294,0.00023676126,0.0001309249,0.00016483889,0.0025815908,0.0016349175,0.00061766076,0.00027047598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053011416,0.0010064165,0.01093917,0.0010936806,0.0005660906,0.00008271827,0.015835548,0.00046840755,0.00023739683,0.41703242,0.056657545,0.49555048],"study_design_scores_gemma":[0.0023466782,0.00024933837,0.011363961,0.0005028741,0.000020779678,0.000055405664,0.00020891424,0.8714051,0.0001317594,0.0032731679,0.109831445,0.0006105274],"about_ca_topic_score_codex":0.00001617994,"about_ca_topic_score_gemma":0.000008370008,"teacher_disagreement_score":0.87093675,"about_ca_system_score_codex":0.00007992251,"about_ca_system_score_gemma":0.00006967917,"threshold_uncertainty_score":0.9991117},"labels":[],"label_agreement":null},{"id":"W3138772443","doi":"10.4230/lipics.icdt.2021.3","title":"Box Covers and Domain Orderings for Beyond Worst-Case Join Processing","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Joins; Computer science; Join (topology); Generalization; Domain (mathematical analysis); Cover (algebra); Set (abstract data type); Algorithm; Approximation algorithm; Block (permutation group theory); Certificate; Theoretical computer science; Discrete mathematics; Mathematics; Combinatorics","score_opus":0.015119934348414504,"score_gpt":0.2510682944724922,"score_spread":0.2359483601240777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3138772443","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09501897,0.00028173756,0.8996075,0.0009624782,0.0007624887,0.0009597701,0.0003450968,0.00023508015,0.0018269159],"genre_scores_gemma":[0.25462663,0.00007339012,0.74097633,0.0031277654,0.00022365601,0.0002479811,0.00025206464,0.00006242997,0.0004097386],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99756396,0.000029626679,0.0008377109,0.00043016855,0.0003634506,0.00077506475],"domain_scores_gemma":[0.9981765,0.00021768715,0.00032509913,0.0006384995,0.0003881816,0.00025398933],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005860065,0.00038083643,0.0004511265,0.00022044004,0.0008405982,0.0011556469,0.0006591103,0.00016934812,0.000013419216],"category_scores_gemma":[0.00011924757,0.0003786111,0.00022440359,0.0005418748,0.00017836395,0.00210097,0.0006732738,0.00030673333,0.000010111336],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003976099,0.0015248817,0.0027374518,0.0072760344,0.000757557,0.0009477828,0.08070659,0.00040116577,0.00076270534,0.3210604,0.021629117,0.56179875],"study_design_scores_gemma":[0.011726738,0.0007046546,0.00023190884,0.00066198653,0.00011440382,0.006815212,0.008261381,0.3955231,0.005047367,0.08762598,0.481028,0.0022592836],"about_ca_topic_score_codex":0.000009564057,"about_ca_topic_score_gemma":0.000041388023,"teacher_disagreement_score":0.55953944,"about_ca_system_score_codex":0.00007590606,"about_ca_system_score_gemma":0.00016954231,"threshold_uncertainty_score":0.99988127},"labels":[],"label_agreement":null},{"id":"W3153655827","doi":"10.4230/lipics.socg.2021.50","title":"Near Neighbor Search via Efficient Average Distortion Embeddings","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Automated Road and Building Extraction","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Embedding; Metric space; Mathematics; Time complexity; Dimension (graph theory); Distortion (music); Metric (unit); Discrete mathematics; Polynomial; Theoretical computer science; Data structure; Computational complexity theory; Structural complexity theory; Linear space; Complexity class; Algorithm; Computer science; Combinatorics; Artificial intelligence","score_opus":0.007212224851921144,"score_gpt":0.22665971025551507,"score_spread":0.21944748540359393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3153655827","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78830206,0.00008052599,0.20513901,0.000056207275,0.0015036449,0.00042722235,0.00019231933,0.0007593283,0.003539653],"genre_scores_gemma":[0.9943394,0.000040694318,0.004197708,0.00013229225,0.00017587986,0.000045352157,0.00069956906,0.00007825278,0.0002908443],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979223,0.000019526597,0.00074904587,0.00020497605,0.0004417156,0.00066240993],"domain_scores_gemma":[0.99901915,0.000060073482,0.000116644755,0.0004129082,0.00020985653,0.00018137027],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002843077,0.0003288174,0.0003270551,0.00014365847,0.00035773843,0.0003196682,0.00023421356,0.0002495252,0.00014711684],"category_scores_gemma":[0.000040589788,0.0003257117,0.00021424347,0.0003428197,0.00005973965,0.0006100465,0.00010069985,0.0004761265,0.00030267402],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017874931,0.00084028003,0.0034641442,0.0037489864,0.00068569515,0.00008488316,0.021624422,0.8758762,0.018465037,0.0019015998,0.015290181,0.057839833],"study_design_scores_gemma":[0.0011185302,0.00005654912,0.0010093731,0.00013155157,0.000038235554,0.0001028905,0.00036643512,0.9232699,0.019573556,0.00003479334,0.053858712,0.00043942896],"about_ca_topic_score_codex":0.000009044085,"about_ca_topic_score_gemma":0.000004401993,"teacher_disagreement_score":0.20603733,"about_ca_system_score_codex":0.00031805338,"about_ca_system_score_gemma":0.00005116344,"threshold_uncertainty_score":0.9999195},"labels":[],"label_agreement":null},{"id":"W3153906568","doi":"10.4230/lipics.socg.2021.35","title":"On Rich Lenses in Planar Arrangements of Circles and Related Problems","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Combinatorics; Degree (music); Plane (geometry); Planar; Lens (geology); Pairwise comparison; Algebraic number; Mathematical proof; Point (geometry); Algebraic curve; Upper and lower bounds; Discrete mathematics; Geometry; Mathematical analysis; Computer science; Physics; Optics","score_opus":0.038478240735234384,"score_gpt":0.2916801594869693,"score_spread":0.2532019187517349,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3153906568","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98768806,0.00023960789,0.0011351109,0.00018182027,0.00024378594,0.00064403214,0.00045564095,0.00005854564,0.009353384],"genre_scores_gemma":[0.9949482,0.00020457103,0.0034350376,0.00023131531,0.000025268027,0.0000633095,0.00022067702,0.000037986483,0.0008336044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99762124,0.00003940195,0.001276916,0.000197147,0.00040570376,0.00045958356],"domain_scores_gemma":[0.9982545,0.00057222514,0.00046085994,0.00036390088,0.0002680147,0.00008052601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061335193,0.00026889192,0.0005576753,0.0004327331,0.00010175304,0.000081832455,0.00021434031,0.00018173874,0.00006239504],"category_scores_gemma":[0.00080118026,0.00024449814,0.00010742751,0.00058116583,0.00008122546,0.00045650385,0.00010694081,0.00026697788,0.000015430742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007720548,0.0056945104,0.053585693,0.050020732,0.0020962593,0.0001003363,0.14363249,0.0002668064,0.000898029,0.6980192,0.016784843,0.028129037],"study_design_scores_gemma":[0.025388688,0.0024094817,0.010117,0.006405003,0.00040347074,0.00035088768,0.039049394,0.0049745487,0.018295811,0.868162,0.02176605,0.0026776637],"about_ca_topic_score_codex":0.000015302801,"about_ca_topic_score_gemma":0.00003749887,"teacher_disagreement_score":0.17014278,"about_ca_system_score_codex":0.000056361394,"about_ca_system_score_gemma":0.00006107887,"threshold_uncertainty_score":0.99703443},"labels":[],"label_agreement":null},{"id":"W3155264699","doi":"10.4230/lipics.socg.2021.10","title":"Characterizing Universal Reconfigurability of Modular Pivoting Robots","year":2021,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Modular Robots and Swarm Intelligence","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Control reconfiguration; Reconfigurability; Vertex (graph theory); Modular design; Computer science; Set (abstract data type); Combinatorics; Reduction (mathematics); Process (computing); Mathematics; Topology (electrical circuits); Algorithm; Geometry; Embedded system","score_opus":0.02016749841390728,"score_gpt":0.23302990188346198,"score_spread":0.2128624034695547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3155264699","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76498085,0.00028494888,0.2238474,0.000063165324,0.0033316473,0.0014455665,0.0010235817,0.00041512764,0.004607728],"genre_scores_gemma":[0.9837805,0.0003250803,0.013585468,0.00009086041,0.00020341165,0.00007689674,0.0017248422,0.00013211818,0.00008081642],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99612194,0.000053040683,0.0020428658,0.0004478061,0.00050463167,0.00082970585],"domain_scores_gemma":[0.9971861,0.00011248783,0.0006364609,0.0013233271,0.0005097267,0.00023187227],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006790879,0.0007628967,0.001228359,0.00030143867,0.00015368982,0.00030994008,0.0009880705,0.00075219345,0.0001554738],"category_scores_gemma":[0.00013160905,0.0008204552,0.0006464159,0.00021568147,0.00013027058,0.0007347228,0.00065688463,0.0013569294,0.000022961472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019468677,0.0007383029,0.0059736907,0.03859941,0.00296739,0.00005924203,0.04877224,0.81372845,0.013300301,0.0022717386,0.00087877735,0.072515756],"study_design_scores_gemma":[0.0014244486,0.00015333775,0.0021166776,0.003150774,0.00025970754,0.00006139296,0.004770764,0.9162155,0.06271267,0.00046031203,0.006446986,0.0022274693],"about_ca_topic_score_codex":0.00007490137,"about_ca_topic_score_gemma":0.000030100013,"teacher_disagreement_score":0.21879968,"about_ca_system_score_codex":0.00032113583,"about_ca_system_score_gemma":0.00013357062,"threshold_uncertainty_score":0.99942464},"labels":[],"label_agreement":null},{"id":"W3158797200","doi":"10.4230/lipics.mfcs.2021.57","title":"Online Domination: The Value of Getting to Know All Your Neighbors","year":2021,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Bipartite graph; Combinatorics; Competitive analysis; Vertex (graph theory); Mathematics; Graph; Planar graph; Node (physics); Set (abstract data type); Computer science; Discrete mathematics; Upper and lower bounds","score_opus":0.030331920693422384,"score_gpt":0.3110980857950028,"score_spread":0.2807661651015804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3158797200","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028563596,0.0001661804,0.9548444,0.007870416,0.0020441145,0.0027370525,0.00061257614,0.0002161863,0.0029454748],"genre_scores_gemma":[0.25162703,0.0004359969,0.7327586,0.009652657,0.0005841535,0.00048197978,0.0030420981,0.00012800423,0.0012895114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957911,0.00014970762,0.0017915169,0.00049404806,0.0010176451,0.0007559851],"domain_scores_gemma":[0.99543226,0.0002868827,0.0009659096,0.0017876392,0.00124252,0.00028480362],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014303608,0.00052077987,0.00069957966,0.00039784933,0.00029288782,0.0010579254,0.0033135056,0.00039069616,0.000040041417],"category_scores_gemma":[0.00041975675,0.00041318688,0.00044850915,0.0005937325,0.000107827225,0.0010122922,0.004098127,0.0010601906,0.000032110955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017017488,0.0032077003,0.0021843293,0.008010995,0.0018263544,0.000031557112,0.23821826,0.44924834,0.00022340423,0.13247752,0.032710973,0.13169037],"study_design_scores_gemma":[0.0014442494,0.00018301597,0.00048447103,0.0008054082,0.000056915105,0.000027969058,0.0024969804,0.9345587,0.00074706716,0.0009832921,0.057482895,0.00072905305],"about_ca_topic_score_codex":0.000041029136,"about_ca_topic_score_gemma":0.000034203953,"teacher_disagreement_score":0.48531032,"about_ca_system_score_codex":0.00018029024,"about_ca_system_score_gemma":0.00043432976,"threshold_uncertainty_score":0.9999791},"labels":[],"label_agreement":null},{"id":"W3165181736","doi":"10.4230/lipics.sea.2021.19","title":"A Graph-Based Similarity Approach to Classify Recurrent Complex Motifs from Their Context in RNA Structures","year":2021,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"RNA and protein synthesis mechanisms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Structural motif; Nucleic acid structure; Computer science; RNA; Riboswitch; Ribozyme; Computational biology; Theoretical computer science; Artificial intelligence; Algorithm; Non-coding RNA; Biology; Genetics","score_opus":0.04017379042250248,"score_gpt":0.2688525933420768,"score_spread":0.22867880291957432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3165181736","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8122458,0.000895145,0.1680057,0.00035026137,0.0016201631,0.004327441,0.010395788,0.00008668271,0.0020730218],"genre_scores_gemma":[0.9428674,0.00009469737,0.03292402,0.0021567068,0.00030059446,0.0006606257,0.020864088,0.000103173006,0.000028691797],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99601036,0.00022072159,0.0014975825,0.00091744657,0.00048895477,0.0008649017],"domain_scores_gemma":[0.9969501,0.00007799035,0.00066241034,0.0016373188,0.00032706608,0.000345129],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056206086,0.00095958554,0.0011185935,0.0002946931,0.00019793968,0.00044178768,0.0013462511,0.0012615123,0.000063068575],"category_scores_gemma":[0.00019475413,0.00087729446,0.00067614403,0.00018925028,0.00013967784,0.000026493997,0.00125174,0.0009456579,0.0000091483225],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.013363404,0.011667538,0.01656014,0.019272251,0.008885073,0.00008039816,0.05149943,0.033316907,0.42716992,0.00672222,0.05213123,0.3593315],"study_design_scores_gemma":[0.016603757,0.002018412,0.010229989,0.0028601505,0.0005045639,0.00004435354,0.015930189,0.062121857,0.6896472,0.010832553,0.18131909,0.007887903],"about_ca_topic_score_codex":0.0001770574,"about_ca_topic_score_gemma":0.00028115703,"teacher_disagreement_score":0.3514436,"about_ca_system_score_codex":0.00013069935,"about_ca_system_score_gemma":0.00032397878,"threshold_uncertainty_score":0.9993678},"labels":[],"label_agreement":null},{"id":"W3167838610","doi":"10.4230/lipics.isaac.2021.39","title":"Multimodal Transportation with Ridesharing of Personal Vehicles","year":2021,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Public transport; Transport engineering; Transit (satellite); Occupancy; Travel behavior; Travel time; Population; Transit system; Computer science; Engineering","score_opus":0.012633370514550827,"score_gpt":0.22722743999134454,"score_spread":0.21459406947679371,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3167838610","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9224809,0.00006172027,0.07113823,0.000042685053,0.000523732,0.00096865604,0.0038829867,0.00029492893,0.00060619845],"genre_scores_gemma":[0.97170603,0.00004646975,0.017599015,0.0000742266,0.00006200055,0.00023392415,0.010170638,0.0000757955,0.000031879827],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99760365,0.000008680547,0.0013274782,0.00023441842,0.0004351953,0.00039058996],"domain_scores_gemma":[0.99856025,0.000054863864,0.00032272018,0.00041865138,0.0005327915,0.00011072069],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019024621,0.0004494281,0.0005845553,0.00027509555,0.000101464684,0.00012720637,0.0003034233,0.00038078037,0.00006635605],"category_scores_gemma":[0.000013969369,0.00045231977,0.0002852775,0.0002485765,0.00010375144,0.0005268307,0.00002614102,0.00073636,0.0000051503735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007021768,0.001540848,0.13070992,0.047712408,0.0050713196,0.00003795246,0.21419518,0.5688608,0.004339788,0.0060619917,0.0015629674,0.019204624],"study_design_scores_gemma":[0.011874302,0.00040283866,0.222606,0.004858212,0.0011478357,0.000038055132,0.031384405,0.68595594,0.0279094,0.00030858596,0.009901946,0.0036124578],"about_ca_topic_score_codex":0.00006051749,"about_ca_topic_score_gemma":0.00042019843,"teacher_disagreement_score":0.18281077,"about_ca_system_score_codex":0.00012460897,"about_ca_system_score_gemma":0.00014115166,"threshold_uncertainty_score":0.9997929},"labels":[],"label_agreement":null},{"id":"W3183449483","doi":"10.4230/lipics.icalp.2021.81","title":"Minimum-Norm Load Balancing Is (Almost) as Easy as Minimizing Makespan","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Norm (philosophy); Job shop scheduling; Approximation algorithm; Random variable; Load balancing (electrical power); Mathematics; Monotone polygon; Mathematical optimization; Combinatorics; Discrete mathematics; Minification; Computer science; Statistics","score_opus":0.00950825918348574,"score_gpt":0.23621623706637002,"score_spread":0.22670797788288427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3183449483","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68257385,0.0015657317,0.13046095,0.0011809389,0.007949786,0.0020512787,0.001163659,0.002793846,0.17025995],"genre_scores_gemma":[0.7041718,0.0006933944,0.2711572,0.008573789,0.0012665304,0.00029660424,0.0021795563,0.0005437463,0.011117385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99676734,0.000025090285,0.001225843,0.00032792884,0.0006968994,0.0009569193],"domain_scores_gemma":[0.99798256,0.00015491522,0.00021307389,0.00074093905,0.00053781644,0.00037071182],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00038349294,0.00056188036,0.00058967737,0.00021497194,0.00032294833,0.00049341,0.0004722868,0.00037099366,0.0005312011],"category_scores_gemma":[0.00029134046,0.0005993131,0.00033631414,0.0005325165,0.000067293506,0.00088885,0.00016947222,0.0005432908,0.0010840727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012745605,0.0027209506,0.02611918,0.016108982,0.0074951933,0.0009992396,0.28557587,0.32259592,0.0056151976,0.011825502,0.14078245,0.17888698],"study_design_scores_gemma":[0.005268728,0.00018248177,0.00020044304,0.0006050944,0.0001580581,0.0005338807,0.01067687,0.7814067,0.024698986,0.0002915792,0.17436408,0.0016131164],"about_ca_topic_score_codex":0.000018313545,"about_ca_topic_score_gemma":0.000013757157,"teacher_disagreement_score":0.45881078,"about_ca_system_score_codex":0.00032053594,"about_ca_system_score_gemma":0.00023746684,"threshold_uncertainty_score":0.9996937},"labels":[],"label_agreement":null},{"id":"W3184117305","doi":"10.4230/lipics.icalp.2021.2","title":"Symmetries and Complexity (Invited Talk)","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Constraint satisfaction problem; Homogeneous space; Computer science; Theoretical computer science; Algebraic number; Algebra over a field; Constraint (computer-aided design); Mathematical optimization; Mathematics; Artificial intelligence; Pure mathematics","score_opus":0.027038361841987664,"score_gpt":0.2497060505491352,"score_spread":0.22266768870714754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3184117305","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042085752,0.00008730009,0.9475189,0.004314656,0.0009281728,0.00050555385,0.00023504221,0.00032051947,0.004004111],"genre_scores_gemma":[0.67685354,0.0001934509,0.30816182,0.01324311,0.00013895893,0.000063246654,0.00077825034,0.000038426693,0.0005291661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984084,0.000036787882,0.0006134014,0.00024764542,0.00030707647,0.00038673062],"domain_scores_gemma":[0.99838495,0.00012792725,0.0002167676,0.00050118554,0.0005895026,0.00017967288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026040678,0.00022991998,0.0002862099,0.00020426375,0.0003548344,0.00065373327,0.00035342778,0.00012596698,0.000059057493],"category_scores_gemma":[0.0002416829,0.0002272915,0.000111909176,0.00052415964,0.00016621797,0.0015668195,0.00037499296,0.0002122447,0.000030231802],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013661095,0.0008291483,0.0359443,0.0016473011,0.0006650418,0.000077676355,0.023417722,0.0007508356,0.00056721957,0.5456335,0.0434085,0.34692216],"study_design_scores_gemma":[0.0068090158,0.00028083596,0.024540603,0.00022352577,0.00006991844,0.00089837133,0.003552455,0.6827029,0.0062835724,0.009974557,0.26315737,0.0015068961],"about_ca_topic_score_codex":0.00001058352,"about_ca_topic_score_gemma":0.000047798312,"teacher_disagreement_score":0.68195206,"about_ca_system_score_codex":0.000060826053,"about_ca_system_score_gemma":0.00007062386,"threshold_uncertainty_score":0.92686784},"labels":[],"label_agreement":null},{"id":"W3184432724","doi":"10.4230/lipics.icalp.2021.67","title":"Constant-Factor Approximation to Deadline TSP and Related Problems in (Almost) Quasi-Polytime","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Alberta","funders":"","keywords":"Rounding; Approximation algorithm; Combinatorics; Orienteering; Metric space; Path (computing); Constant (computer programming); Mathematics; Travelling salesman problem; Binary logarithm; Randomized rounding; Metric (unit); Point (geometry); Time complexity; Computer science; Discrete mathematics; Mathematical optimization","score_opus":0.014313825941000835,"score_gpt":0.2530143342341167,"score_spread":0.23870050829311584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3184432724","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57485,0.000202942,0.4137,0.000375602,0.00075505144,0.0019636152,0.00051111775,0.00067371025,0.0069679455],"genre_scores_gemma":[0.8211452,0.00008810379,0.17716977,0.00029867282,0.00005275013,0.00013383928,0.0006440945,0.00011870581,0.0003488635],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99756014,0.00006238796,0.0012690872,0.0002384337,0.00028214362,0.0005877947],"domain_scores_gemma":[0.99881095,0.00017203487,0.00016354151,0.00041006622,0.00022499006,0.00021841865],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058185507,0.00035130355,0.00048030028,0.0003199277,0.000113318296,0.0002060419,0.0002050085,0.00027419676,0.000084200154],"category_scores_gemma":[0.00033490747,0.0003739687,0.000087322944,0.000682065,0.000051619492,0.0007246133,0.00013353096,0.00040395043,0.00006278894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020204455,0.0012828084,0.08994833,0.009265878,0.0009952569,0.000058441554,0.105148695,0.66341394,0.01074154,0.011720096,0.003090909,0.10413204],"study_design_scores_gemma":[0.0031786188,0.000118156895,0.0019946084,0.00041308143,0.00003216115,0.00012146584,0.0012675826,0.9831808,0.0035760682,0.0003515431,0.0050845547,0.00068132085],"about_ca_topic_score_codex":0.000006385709,"about_ca_topic_score_gemma":0.00002042737,"teacher_disagreement_score":0.31976688,"about_ca_system_score_codex":0.00019547087,"about_ca_system_score_gemma":0.00006150484,"threshold_uncertainty_score":0.99987125},"labels":[],"label_agreement":null},{"id":"W3184553479","doi":"10.4230/lipics.icalp.2021.86","title":"Automorphisms and Isomorphisms of Maps in Linear Time","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Automorphism; Mathematics; Embedding; Antipodal point; Combinatorics; Isomorphism (crystallography); Homeomorphism (graph theory); Surface (topology); Vertex (graph theory); Discrete mathematics; Graph; Computer science; Geometry; Artificial intelligence","score_opus":0.022853191756842545,"score_gpt":0.2816594830081233,"score_spread":0.2588062912512808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3184553479","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98615354,0.0002523739,0.005611202,0.0006714803,0.00054769777,0.00082846393,0.00076377863,0.00011408693,0.005057396],"genre_scores_gemma":[0.9406948,0.00013119109,0.053637717,0.0007562324,0.00013363517,0.00007306174,0.0005601426,0.0000879911,0.003925248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99747634,0.00005350732,0.0013209974,0.0002372981,0.00033478477,0.00057705306],"domain_scores_gemma":[0.99806404,0.0005486076,0.00045153557,0.00052407675,0.00025979304,0.00015197437],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006219433,0.00031508732,0.000786884,0.00042677845,0.000094174124,0.00004334785,0.0003070113,0.00029909582,0.00030802973],"category_scores_gemma":[0.00061220117,0.00029548397,0.00017426076,0.00060534297,0.00022794545,0.00034344813,0.0003048256,0.00035278464,0.00009348874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012017314,0.008677639,0.12597604,0.015904844,0.0023680776,0.0005236954,0.06891343,0.00019594697,0.004448788,0.59246397,0.12517916,0.054146666],"study_design_scores_gemma":[0.05461423,0.003146861,0.015319238,0.002451352,0.0009010567,0.0028526566,0.018722354,0.08130972,0.042293448,0.48842806,0.28442985,0.005531178],"about_ca_topic_score_codex":0.000012069201,"about_ca_topic_score_gemma":0.00001726669,"teacher_disagreement_score":0.1592507,"about_ca_system_score_codex":0.000059714508,"about_ca_system_score_gemma":0.00011013117,"threshold_uncertainty_score":0.99994975},"labels":[],"label_agreement":null},{"id":"W3185954029","doi":"10.4230/lipics.icalp.2021.44","title":"Lifting for Constant-Depth Circuits and Applications to MCSP","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; Simon Fraser University","funders":"","keywords":"Constant (computer programming); Electronic circuit; Computer science; Electrical engineering; Engineering","score_opus":0.024541543105000695,"score_gpt":0.2865105065907636,"score_spread":0.26196896348576293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3185954029","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015507012,0.000079389516,0.9897199,0.0006560922,0.00019890307,0.0013072405,0.00015039032,0.0004751589,0.005862214],"genre_scores_gemma":[0.2434498,0.00005871285,0.750925,0.0039138948,0.00018097665,0.0007192746,0.0002492037,0.00004195574,0.00046115043],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99818647,0.000023812268,0.0007125921,0.0003395313,0.00022938309,0.000508197],"domain_scores_gemma":[0.9981009,0.00024405326,0.00024151252,0.0006326999,0.0005507975,0.00023003413],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004356972,0.00024102286,0.00031326708,0.00018250199,0.0004799802,0.0005725694,0.0006647972,0.0001269354,0.000003375382],"category_scores_gemma":[0.00016281113,0.0002482489,0.00011692366,0.00044306865,0.000051315143,0.00064972165,0.00045192402,0.00015887873,0.00002074093],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041013278,0.00056523696,0.0040466413,0.0015229065,0.00029058507,0.000007794387,0.01608098,0.0036272558,0.00054582884,0.4558623,0.029516311,0.48789313],"study_design_scores_gemma":[0.0029590293,0.00034536514,0.00035064094,0.00029456988,0.000047322457,0.00019088914,0.0009065236,0.4500862,0.008119639,0.008815056,0.5266828,0.001201957],"about_ca_topic_score_codex":0.0000022943875,"about_ca_topic_score_gemma":0.0000061023775,"teacher_disagreement_score":0.4971665,"about_ca_system_score_codex":0.000057647336,"about_ca_system_score_gemma":0.0001304048,"threshold_uncertainty_score":0.99999696},"labels":[],"label_agreement":null},{"id":"W3186306330","doi":"10.4230/lipics.ccc.2021.30","title":"On Query-To-Communication Lifting for Adversary Bounds","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Upper and lower bounds; Communication complexity; Mathematics; Gadget; Adversary; Constant (computer programming); Computation; Quantum; Discrete mathematics; Secure two-party computation; Quantum computer; Bounded function; Theoretical computer science; Computer science; Combinatorics; Secure multi-party computation; Algorithm; Quantum mechanics","score_opus":0.012678107947237451,"score_gpt":0.2669322982956679,"score_spread":0.25425419034843044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3186306330","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0707729,0.0001160639,0.91938883,0.0016296663,0.00095512863,0.0011993229,0.0009670513,0.00032135428,0.004649652],"genre_scores_gemma":[0.59673315,0.00007522549,0.3926626,0.0076608295,0.0001689274,0.00036554842,0.0021925473,0.000049197417,0.00009195467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99763113,0.000053640906,0.00085559423,0.00036980872,0.0004147868,0.0006750374],"domain_scores_gemma":[0.9966883,0.00050573115,0.00029977778,0.0018106177,0.0004436698,0.0002518734],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007565152,0.00032024021,0.0003573875,0.00028199947,0.00074318395,0.00074746006,0.0016353648,0.00018080632,0.000016354157],"category_scores_gemma":[0.00036052876,0.00032351472,0.0003394889,0.0006661611,0.00006892243,0.0019783815,0.0008129596,0.00034513496,0.00008770667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002273076,0.00083097955,0.00130426,0.0007276642,0.0002341912,0.0000068658696,0.02092843,0.00027549738,0.00020118192,0.8910442,0.041229747,0.042989664],"study_design_scores_gemma":[0.0073913317,0.0010282468,0.0020137841,0.00080457894,0.000089031426,0.00009757612,0.0033728532,0.12858945,0.007028653,0.071507215,0.77617145,0.0019058133],"about_ca_topic_score_codex":0.000013214592,"about_ca_topic_score_gemma":0.000036235495,"teacher_disagreement_score":0.819537,"about_ca_system_score_codex":0.00009858317,"about_ca_system_score_gemma":0.0001388984,"threshold_uncertainty_score":0.9999217},"labels":[],"label_agreement":null},{"id":"W3186369772","doi":"10.4230/lipics.ccc.2021.36","title":"On the Pseudo-Deterministic Query Complexity of NP Search Problems","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Deterministic algorithm; Mathematics; Randomized algorithm; Computational complexity theory; Time complexity; Contrast (vision); Algorithm; Discrete mathematics; Theoretical computer science; Combinatorics; Computer science","score_opus":0.06558652675906523,"score_gpt":0.2789850136981461,"score_spread":0.21339848693908087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3186369772","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31982264,0.00009847357,0.6494095,0.0054363324,0.0023053845,0.00243007,0.0011170645,0.0004285996,0.01895197],"genre_scores_gemma":[0.9472359,0.00003465745,0.04959088,0.0023591,0.00011627082,0.00011222612,0.00016166289,0.000035944027,0.0003533849],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99679846,0.00014065616,0.0011054494,0.00036242558,0.0008459907,0.00074704684],"domain_scores_gemma":[0.9965779,0.00076496176,0.00035843631,0.0015909942,0.0005331209,0.00017458951],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009912644,0.00036434157,0.0005075,0.00020404227,0.000557465,0.00044811462,0.0020565072,0.00014484723,0.00008220033],"category_scores_gemma":[0.00021809887,0.00027775424,0.00037706847,0.00072076276,0.0005739649,0.00070705154,0.0010067525,0.0005974331,0.0000934885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048544764,0.00076603994,0.0006065108,0.00088279916,0.0001908804,0.000019465358,0.009345456,0.00039405905,0.000169387,0.973199,0.0043312693,0.010046592],"study_design_scores_gemma":[0.004112328,0.001275254,0.0027616837,0.0008769995,0.000069413974,0.0004834393,0.0022271143,0.72466916,0.01079696,0.21792217,0.033317808,0.001487665],"about_ca_topic_score_codex":0.000023583336,"about_ca_topic_score_gemma":0.000028490113,"teacher_disagreement_score":0.75527686,"about_ca_system_score_codex":0.00007186403,"about_ca_system_score_gemma":0.0002086428,"threshold_uncertainty_score":0.99996746},"labels":[],"label_agreement":null},{"id":"W3186774379","doi":"10.4230/lipics.icalp.2021.9","title":"Almost-Linear-Time Weighted 𝓁 p -Norm Solvers in Slightly Dense Graphs via Sparsification.","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Multiplicative function; Mathematics; Voltage; Norm (philosophy); Iterative refinement; Combinatorics; Binary logarithm; Discrete mathematics; Applied mathematics; Algorithm; Mathematical analysis; Physics","score_opus":0.015473223014820708,"score_gpt":0.2422710938439041,"score_spread":0.2267978708290834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3186774379","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23483679,0.00034665526,0.74332213,0.0026750634,0.0031034222,0.0022079025,0.00062457955,0.0009212499,0.011962216],"genre_scores_gemma":[0.50236356,0.00032778297,0.4877787,0.004723767,0.00037057645,0.00035418928,0.0020380828,0.00014300767,0.0019003273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958848,0.00009244308,0.0015321135,0.000613465,0.00076993357,0.0011072768],"domain_scores_gemma":[0.9968143,0.00027125675,0.00045845748,0.0015717677,0.000551145,0.00033304896],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007026226,0.00054862123,0.0006515983,0.00060465315,0.00048234896,0.0005010552,0.0018625704,0.00030079283,0.00014078342],"category_scores_gemma":[0.00008716253,0.00055519416,0.00043486708,0.0017836995,0.00020101253,0.0022489782,0.0006940956,0.00062047754,0.00050099497],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00085570733,0.009842356,0.03868462,0.0028509123,0.002256803,0.0010221748,0.08808323,0.0018804154,0.004678726,0.49896124,0.05891575,0.29196808],"study_design_scores_gemma":[0.0059394194,0.000304905,0.0035223207,0.00030057543,0.000062140905,0.00043426178,0.0008852074,0.8348144,0.008883215,0.028575387,0.11456812,0.0017100191],"about_ca_topic_score_codex":0.000037792277,"about_ca_topic_score_gemma":0.00006691003,"teacher_disagreement_score":0.832934,"about_ca_system_score_codex":0.00018710028,"about_ca_system_score_gemma":0.00024110655,"threshold_uncertainty_score":0.99968994},"labels":[],"label_agreement":null},{"id":"W3187834769","doi":"10.4230/lipics.disc.2021.13","title":"A Tight Local Algorithm for the Minimum Dominating Set Problem in Outerplanar Graphs","year":2021,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Air Force Office of Scientific Research; Institute for Basic Science; Agence Nationale de la Recherche; National Science Foundation","keywords":"Dominating set; Mathematics; Vertex (graph theory); Combinatorics; Approximation algorithm; Constant (computer programming); Graph; Independent set; Discrete mathematics; Degree (music); Algorithm; Computer science; Physics","score_opus":0.0237182243147758,"score_gpt":0.27425245885769994,"score_spread":0.2505342345429241,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3187834769","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029840486,0.0003899677,0.9857943,0.001112941,0.0031367042,0.0041036247,0.0016759472,0.0002517122,0.0005507542],"genre_scores_gemma":[0.04989778,0.00023076554,0.9417846,0.0020360053,0.00044308274,0.002870374,0.0023494984,0.00012889167,0.00025900936],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99420273,0.0001300686,0.0023135666,0.000953425,0.00092661375,0.0014736169],"domain_scores_gemma":[0.9949066,0.0010612583,0.0010691419,0.0021080412,0.00060053635,0.00025444003],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0019432891,0.0009886905,0.0011943106,0.0006877553,0.0007144838,0.0018888762,0.0045295106,0.0007041583,0.000016340393],"category_scores_gemma":[0.00010392237,0.0008088595,0.0010281358,0.00081125926,0.00036541893,0.0012878678,0.0038016273,0.0018107995,0.000015083252],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011378892,0.0010028445,0.0006730236,0.004739804,0.0011688787,0.00008461754,0.059521977,0.0035666951,0.000007619141,0.030409595,0.009509184,0.889202],"study_design_scores_gemma":[0.0029452124,0.00019905114,0.00015125642,0.0010238831,0.00008099948,0.00010510478,0.0030261748,0.9510344,0.00017624849,0.017765265,0.02241655,0.0010758511],"about_ca_topic_score_codex":0.00012713118,"about_ca_topic_score_gemma":0.00020387162,"teacher_disagreement_score":0.9474677,"about_ca_system_score_codex":0.00027438247,"about_ca_system_score_gemma":0.0004198116,"threshold_uncertainty_score":0.9994362},"labels":[],"label_agreement":null},{"id":"W3189431800","doi":"10.4230/lipics.disc.2021.4","title":"Lower Bounds for Shared-Memory Leader Election Under Bounded Write Contention","year":2021,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Leader election; Computer science; Bounded function; Asynchronous communication; Logarithm; Concurrency; Randomized algorithm; Upper and lower bounds; Shared memory; Parallel computing; Theoretical computer science; Algorithm; Distributed computing; Mathematics; Computer network","score_opus":0.026453677728506226,"score_gpt":0.2748358487098276,"score_spread":0.24838217098132134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3189431800","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031367566,0.0004242948,0.94967073,0.0008510854,0.00969667,0.0034191161,0.0021513412,0.000521931,0.001897282],"genre_scores_gemma":[0.93439215,0.000119389995,0.039377958,0.003333957,0.0012297096,0.0024528007,0.013752568,0.00020107771,0.0051403693],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944145,0.000066466935,0.002265389,0.0010079594,0.0009250712,0.0013205804],"domain_scores_gemma":[0.9946031,0.0001480199,0.0013725727,0.001925203,0.0016352771,0.0003158209],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010425511,0.00094894523,0.0012120226,0.00038777108,0.0007367493,0.0043664007,0.002018034,0.0010774989,0.000041746538],"category_scores_gemma":[0.00012088011,0.00096228725,0.0011404863,0.00045468364,0.00015233752,0.0028509581,0.0011620084,0.0011655374,0.000069051974],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002992347,0.010619757,0.0029576407,0.05815821,0.011938995,0.00017350966,0.07818507,0.021152385,0.0032475104,0.22093226,0.4278991,0.16174324],"study_design_scores_gemma":[0.01245829,0.00090104504,0.0014818279,0.0037801869,0.000349814,0.0002954764,0.0051576854,0.66120017,0.0019565462,0.007860858,0.30042276,0.004135364],"about_ca_topic_score_codex":0.00007961051,"about_ca_topic_score_gemma":0.00012086772,"teacher_disagreement_score":0.91029274,"about_ca_system_score_codex":0.00064704317,"about_ca_system_score_gemma":0.00052738073,"threshold_uncertainty_score":0.9992828},"labels":[],"label_agreement":null},{"id":"W3191976396","doi":"10.4230/lipics.disc.2021.12","title":"Space and Time Bounded Multiversion Garbage Collection","year":2021,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Horizon 2020 Framework Programme","keywords":"Garbage collection; Amortized analysis; Computer science; Garbage; Bounded function; Pointer (user interface); Concurrency; Constant (computer programming); Reachability; Concurrency control; Set (abstract data type); Data structure; Algorithm; Theoretical computer science; Programming language; Mathematics; Artificial intelligence","score_opus":0.01013403197380855,"score_gpt":0.23305664676178328,"score_spread":0.22292261478797473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3191976396","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17452905,0.00051450223,0.8045453,0.00073869905,0.004289814,0.0031669324,0.0014253748,0.00062776724,0.010162567],"genre_scores_gemma":[0.8930405,0.00038253344,0.09634009,0.0008184018,0.00038378814,0.00038392076,0.0033941471,0.000107955144,0.00514866],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99682015,0.00008783764,0.0010800437,0.00067476573,0.000632064,0.00070511753],"domain_scores_gemma":[0.99702793,0.00011873515,0.00079740374,0.0012129628,0.00056646264,0.00027651986],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00063336233,0.0006203854,0.00083935395,0.00027850544,0.0005499415,0.0020229318,0.0011496923,0.00064792554,0.000023377936],"category_scores_gemma":[0.00009431782,0.0006190576,0.0003393328,0.00039615177,0.00011765231,0.0014754027,0.0021456517,0.0008376623,0.00008379855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018621393,0.0069568744,0.01738632,0.045395613,0.0074507413,0.000637303,0.28625098,0.0078294845,0.004522302,0.10976053,0.40702543,0.104922295],"study_design_scores_gemma":[0.004518513,0.00026577347,0.0014096627,0.0016563211,0.000093897,0.000175986,0.0015721092,0.8773536,0.0012668548,0.00091151666,0.10918037,0.001595406],"about_ca_topic_score_codex":0.00009206945,"about_ca_topic_score_gemma":0.000018230277,"teacher_disagreement_score":0.8695241,"about_ca_system_score_codex":0.00033139807,"about_ca_system_score_gemma":0.00026096613,"threshold_uncertainty_score":0.9996261},"labels":[],"label_agreement":null},{"id":"W3193009786","doi":"10.4230/lipics.itc.2021.18","title":"Differentially Private Approximations of a Convex Hull in Low Dimensions","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Convex hull; Mathematics; Convex body; Combinatorics; Regular polygon; Minimum bounding box; Kernel (algebra); Bounding overwatch; Euclidean space; Ball (mathematics); Hull; Approximation algorithm; Discrete mathematics; Geometry; Image (mathematics); Computer science; Artificial intelligence","score_opus":0.01235288857539698,"score_gpt":0.24311820232689443,"score_spread":0.23076531375149745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193009786","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36174387,0.000037625483,0.6362701,0.00027702865,0.0004024466,0.0004261758,0.00009528872,0.000055327855,0.00069214666],"genre_scores_gemma":[0.9045019,0.00002495776,0.094299585,0.00041978338,0.000047022342,0.00006868917,0.00044995616,0.000013059035,0.00017505433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979465,0.00005301918,0.0009979522,0.00023569188,0.0004030866,0.00036373505],"domain_scores_gemma":[0.99849015,0.00017228146,0.00032363486,0.00047135836,0.000430395,0.00011215592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030734614,0.00020931079,0.00034845853,0.00032261634,0.00015537588,0.0001786484,0.0005198662,0.00011526978,0.000025287347],"category_scores_gemma":[0.00014393954,0.00020662526,0.0001630895,0.0007804015,0.000053892552,0.00099966,0.00037926532,0.00020099967,0.00002905365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012612336,0.0035320844,0.008185934,0.0023619994,0.00041431026,0.000032720545,0.02532207,0.03130643,0.011796321,0.8778052,0.0023304021,0.036786444],"study_design_scores_gemma":[0.004186666,0.0001866867,0.01027671,0.0003695645,0.00003280955,0.00006763954,0.00043006608,0.9333027,0.028668929,0.011749941,0.0101125445,0.00061577087],"about_ca_topic_score_codex":0.0000044748112,"about_ca_topic_score_gemma":0.000023904258,"teacher_disagreement_score":0.90199625,"about_ca_system_score_codex":0.000059265163,"about_ca_system_score_gemma":0.00018881493,"threshold_uncertainty_score":0.8425934},"labels":[],"label_agreement":null},{"id":"W3193864805","doi":"10.4230/lipics.esa.2021.58","title":"QCSP on Reflexive Tournaments","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Combinatorics; Vertex (graph theory); Tournament; Mathematics; Constraint satisfaction problem; Graph; Statistics","score_opus":0.030196304247193714,"score_gpt":0.3282804791982487,"score_spread":0.298084174951055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193864805","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1360386,0.00015714395,0.79414076,0.0022615418,0.002401933,0.0018166183,0.00047072262,0.0006794649,0.062033195],"genre_scores_gemma":[0.80236626,0.00017836082,0.18061376,0.008632027,0.0004168332,0.00033995748,0.00046890328,0.00013508927,0.0068487963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965304,0.00010119258,0.00089321163,0.00045273712,0.0009473846,0.0010750865],"domain_scores_gemma":[0.99688786,0.00029689516,0.00031732093,0.0015739558,0.0005633475,0.00036060656],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007006098,0.00039485306,0.0004329518,0.00033218123,0.00047461016,0.00059834996,0.0018261835,0.00018405887,0.00007697072],"category_scores_gemma":[0.00027144648,0.00036253352,0.00030207192,0.00074954575,0.00013509773,0.0019879707,0.00093853346,0.0006628053,0.0005899089],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005143791,0.0016067951,0.0030116881,0.0006959393,0.00062333257,0.0002788254,0.012426399,0.0009846407,0.001106528,0.8237344,0.018653395,0.13636366],"study_design_scores_gemma":[0.014365579,0.0024689832,0.0019285122,0.0009703058,0.000066147,0.0006405184,0.0039152233,0.08810472,0.06430718,0.1626364,0.65756226,0.0030341628],"about_ca_topic_score_codex":0.000002100585,"about_ca_topic_score_gemma":0.0000048277957,"teacher_disagreement_score":0.66632766,"about_ca_system_score_codex":0.00023477794,"about_ca_system_score_gemma":0.00017377414,"threshold_uncertainty_score":0.99988264},"labels":[],"label_agreement":null},{"id":"W3194730801","doi":"10.4230/lipics.esa.2021.65","title":"The Visibility Center of a Simple Polygon","year":2021,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Simple polygon; Visibility polygon; Visibility; Polygon (computer graphics); Geodesic; Center (category theory); Combinatorics; Star-shaped polygon; Polygon covering; Mathematics; Point (geometry); Set (abstract data type); Rectilinear polygon; Point in polygon; Polygon mesh; Geometry; Computer science; Regular polygon; Physics; Convex set; Optics","score_opus":0.017318214488164826,"score_gpt":0.27752543314692063,"score_spread":0.2602072186587558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3194730801","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25063908,0.00031621888,0.741455,0.0007343726,0.0030786346,0.001525886,0.0006806257,0.00014785193,0.0014223004],"genre_scores_gemma":[0.9595867,0.00013267521,0.03680834,0.00069986907,0.0002827337,0.00017044067,0.002065973,0.000033035634,0.0002202648],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99616253,0.00012516725,0.0017391123,0.0005069545,0.0008349908,0.00063126296],"domain_scores_gemma":[0.99557513,0.0004141614,0.0010222265,0.0018274975,0.0009856076,0.00017536576],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012327033,0.00047731085,0.00060471764,0.00023070484,0.00047403856,0.001057208,0.0021119174,0.00035103687,0.000018051462],"category_scores_gemma":[0.00025757804,0.00038144918,0.00058912864,0.0004459075,0.00013428365,0.0009358634,0.0027542245,0.00070806255,0.00001882318],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00096246233,0.0060779233,0.022624379,0.0138987005,0.004008061,0.000037883074,0.07667487,0.0678694,0.0011010258,0.16229221,0.052021354,0.5924317],"study_design_scores_gemma":[0.0039048034,0.0004328968,0.0065179123,0.0005875791,0.00011243813,0.000088216606,0.001472821,0.82825667,0.008652115,0.01932629,0.12906507,0.0015831925],"about_ca_topic_score_codex":0.00003219129,"about_ca_topic_score_gemma":0.000057370846,"teacher_disagreement_score":0.76038724,"about_ca_system_score_codex":0.0001668103,"about_ca_system_score_gemma":0.000454411,"threshold_uncertainty_score":0.9999798},"labels":[],"label_agreement":null},{"id":"W3196499363","doi":"10.4230/lipics.esa.2021.70","title":"Hypersuccinct Trees - New Universal Tree Source Codes for Optimal Compressed Tree Data Structures and Range Minima","year":2021,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Optimal binary search tree; Random binary tree; Ternary search tree; Binary tree; Range tree; Tree (set theory); Data structure; Binary search tree; K-ary tree; Weight-balanced tree; Interval tree; Range (aeronautics); Random access; Computer science; Mathematics; Combinatorics; Discrete mathematics; Binary number; Search tree; Algorithm; Tree structure; Search algorithm; Arithmetic","score_opus":0.036877857656343445,"score_gpt":0.274961936432509,"score_spread":0.23808407877616555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196499363","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036922034,0.0009104336,0.9507645,0.00048007348,0.0018213557,0.0020623426,0.006323019,0.00033831643,0.00037794956],"genre_scores_gemma":[0.089616425,0.00046500488,0.88251066,0.00073780405,0.0010267879,0.00013637201,0.024491448,0.00016452724,0.00085097394],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955182,0.000087869,0.00135128,0.0012598598,0.0007778593,0.0010049014],"domain_scores_gemma":[0.9940155,0.00052167464,0.00092994637,0.0036527566,0.00035494025,0.00052518985],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00051347865,0.0010072769,0.0013243417,0.00037517707,0.00058499177,0.0023312618,0.005612273,0.0006667014,0.000026099404],"category_scores_gemma":[0.00015267398,0.0009037728,0.00038069233,0.00022644739,0.0002205468,0.0031435548,0.0105054835,0.0008632218,0.000005584618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019169699,0.00114033,0.0031172656,0.005853039,0.002880419,0.00009113294,0.04139351,0.008358068,0.00025997666,0.0066600996,0.2040462,0.724283],"study_design_scores_gemma":[0.0067758304,0.00031824532,0.0014136353,0.00051774736,0.00025330274,0.00008669955,0.002162495,0.8452858,0.00028816235,0.00049085484,0.14113648,0.0012707784],"about_ca_topic_score_codex":0.0002602237,"about_ca_topic_score_gemma":0.00026886677,"teacher_disagreement_score":0.8369277,"about_ca_system_score_codex":0.00012593057,"about_ca_system_score_gemma":0.00050603383,"threshold_uncertainty_score":0.99976784},"labels":[],"label_agreement":null},{"id":"W3198367481","doi":"10.4230/lipics.esa.2021.17","title":"Distant Representatives for Rectangles in the Plane","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Plane (geometry); Combinatorics; Approximation algorithm; Set (abstract data type); Constant (computer programming); Time complexity; Mathematics; Point (geometry); Polynomial; Computational geometry; Object (grammar); Polynomial-time approximation scheme; Discrete mathematics; Computer science; Algorithm; Geometry; Artificial intelligence; Mathematical analysis","score_opus":0.0225185920211277,"score_gpt":0.2908109689955102,"score_spread":0.26829237697438246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198367481","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0733056,0.00016999134,0.9192048,0.002414716,0.00092718995,0.0010694207,0.00027342094,0.00007729279,0.0025575757],"genre_scores_gemma":[0.8528331,0.000065295724,0.14109269,0.0028398004,0.00031936294,0.00048111888,0.0017334565,0.000023253497,0.0006119243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983325,0.00007321992,0.0006302524,0.00024805762,0.00035137963,0.0003645755],"domain_scores_gemma":[0.99837977,0.00061502354,0.00019205615,0.0005113006,0.00024170887,0.00006014109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006800677,0.00018233576,0.00021734805,0.00014091017,0.00026043452,0.00043915867,0.0006942589,0.0000750244,0.000008233515],"category_scores_gemma":[0.00024280265,0.00014014936,0.0001430031,0.0005320672,0.00004294854,0.0009424307,0.00016661016,0.00016085964,0.000014117454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042235389,0.001613451,0.0051202993,0.0012147545,0.00033100919,0.00007413864,0.107962936,0.007404076,0.0014051837,0.7126623,0.047375478,0.11441404],"study_design_scores_gemma":[0.0076116286,0.0006731136,0.006879691,0.00024785197,0.000051798044,0.00037509427,0.010914942,0.43365827,0.017321624,0.06102117,0.46007136,0.0011734586],"about_ca_topic_score_codex":0.0000052753517,"about_ca_topic_score_gemma":0.00004810006,"teacher_disagreement_score":0.7795275,"about_ca_system_score_codex":0.00005653682,"about_ca_system_score_gemma":0.00011735414,"threshold_uncertainty_score":0.5715125},"labels":[],"label_agreement":null},{"id":"W3198482522","doi":"10.4230/lipics.esa.2021.46","title":"Space Efficient Two-Dimensional Orthogonal Colored Range Counting","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Rectangle; Space (punctuation); Combinatorics; Mathematics; Multiplication (music); Linear space; Matrix (chemical analysis); Colored; Range (aeronautics); Set (abstract data type); Discrete mathematics; Upper and lower bounds; Algorithm; Computer science; Geometry","score_opus":0.013824082897404031,"score_gpt":0.2761275067103163,"score_spread":0.2623034238129122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198482522","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1284577,0.00021683192,0.8648391,0.0006356506,0.0008915418,0.00083030947,0.0002057136,0.0005869444,0.003336244],"genre_scores_gemma":[0.6225024,0.00003551593,0.372508,0.0034039237,0.00026909297,0.00013370585,0.000373802,0.00006701984,0.00070657703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967393,0.000055655124,0.0009981224,0.00045801708,0.0008552682,0.00089363026],"domain_scores_gemma":[0.997244,0.00028719538,0.00044505077,0.0008880062,0.0008920331,0.00024370526],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00072661514,0.0004234934,0.0005050337,0.00020536159,0.00049361313,0.00050967897,0.0009494265,0.00017117617,0.000046242913],"category_scores_gemma":[0.00028502103,0.0003960598,0.00031434372,0.0007275309,0.00013326235,0.0014638338,0.0009082607,0.00047011353,0.00012359099],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017340508,0.008233932,0.027032213,0.004298075,0.0017955658,0.0013690328,0.031840872,0.02691204,0.02270413,0.6091852,0.07555884,0.18933603],"study_design_scores_gemma":[0.010262975,0.0007665421,0.0016995405,0.00067618774,0.00010124219,0.00093036046,0.0007912975,0.6471237,0.14367318,0.0060959337,0.18551832,0.0023607288],"about_ca_topic_score_codex":0.0000055484074,"about_ca_topic_score_gemma":0.0000070933183,"teacher_disagreement_score":0.62021166,"about_ca_system_score_codex":0.00016816272,"about_ca_system_score_gemma":0.00026049512,"threshold_uncertainty_score":0.99984914},"labels":[],"label_agreement":null},{"id":"W3198931134","doi":"10.4230/lipics.calco.2021.7","title":"Tensor of Quantitative Equational Theories","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Physics and Python Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Tensor (intrinsic definition); Theoretical physics; Mathematical physics; Mathematics; Physics; Pure mathematics","score_opus":0.023136533542534463,"score_gpt":0.2918314372074361,"score_spread":0.2686949036649016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198931134","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018597363,0.000046450066,0.97382826,0.00095514656,0.00027666384,0.00032819132,0.00044075222,0.000069529095,0.005457627],"genre_scores_gemma":[0.7855592,0.000011592193,0.21288538,0.00065773586,0.000060970382,0.000083083694,0.0005005833,0.0000142778135,0.00022716985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983831,0.000031957785,0.0007038255,0.00019706468,0.00042318666,0.0002608573],"domain_scores_gemma":[0.99750125,0.00053723773,0.00035226287,0.0005173972,0.0010055582,0.00008630297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028189897,0.00017529936,0.00026121116,0.00010861567,0.00020857528,0.00018589599,0.0005994322,0.00006463885,0.00002839706],"category_scores_gemma":[0.00012489723,0.0001663512,0.00018455638,0.0004913514,0.00010278444,0.00084906124,0.00028203297,0.00014089175,0.00007670759],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011725113,0.00016323975,0.00034312453,0.00008122827,0.000068067384,6.704006e-7,0.0030778525,0.00079717475,0.00017369703,0.9905939,0.0005323466,0.004156954],"study_design_scores_gemma":[0.0014178401,0.0001549163,0.0032568073,0.00007329282,0.000025220063,0.000027125669,0.0010813853,0.2883642,0.0047477055,0.67731667,0.023107773,0.0004270984],"about_ca_topic_score_codex":0.000004836579,"about_ca_topic_score_gemma":0.000004793231,"teacher_disagreement_score":0.7669618,"about_ca_system_score_codex":0.00003595114,"about_ca_system_score_gemma":0.00022997853,"threshold_uncertainty_score":0.6783605},"labels":[],"label_agreement":null},{"id":"W3199722554","doi":"10.4230/lipics.isaac.2021.44","title":"Exact and Approximation Algorithms for Many-To-Many Point Matching in the Plane","year":2021,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Bipartite graph; Mathematics; Euclidean geometry; Matching (statistics); Planar graph; Planar; Approximation algorithm; Plane (geometry); Cover (algebra); Discrete mathematics; Graph; Geometry; Computer science","score_opus":0.02379987069991624,"score_gpt":0.27714837656340074,"score_spread":0.2533485058634845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3199722554","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11825139,0.00009100526,0.87592655,0.0014014067,0.0010867693,0.0026000182,0.00027954517,0.00008173988,0.00028156384],"genre_scores_gemma":[0.5230787,0.00006465881,0.46840975,0.003027006,0.00045533082,0.0011673293,0.003660395,0.000044026812,0.000092826995],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971176,0.00008804589,0.0011522907,0.00051784894,0.0005867489,0.00053746434],"domain_scores_gemma":[0.99789554,0.00040905495,0.00047655284,0.0007855355,0.00029884823,0.000134462],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016691069,0.00044816325,0.000503355,0.0004854574,0.0003259096,0.0016527737,0.0011730472,0.000283201,0.0000046834834],"category_scores_gemma":[0.00012267426,0.00038018118,0.00020733934,0.00038078873,0.00003398394,0.0011777084,0.0010644918,0.00058627885,0.0000104599085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037193732,0.0016246564,0.00077090994,0.011016025,0.0007282709,0.000047083297,0.33074164,0.15185478,0.0003489015,0.14958954,0.008439923,0.34446633],"study_design_scores_gemma":[0.0017749146,0.00020604924,0.001584434,0.00046581897,0.0000400871,0.00011874277,0.0030169461,0.97156185,0.00043967852,0.013130139,0.006941354,0.00071998156],"about_ca_topic_score_codex":0.000030043804,"about_ca_topic_score_gemma":0.000027484826,"teacher_disagreement_score":0.8197071,"about_ca_system_score_codex":0.000141159,"about_ca_system_score_gemma":0.00015464867,"threshold_uncertainty_score":0.999865},"labels":[],"label_agreement":null},{"id":"W3201703753","doi":"10.4230/lipics.approx/random.2021.25","title":"Hitting Weighted Even Cycles in Planar Graphs","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Planar graph; Mathematics; Transversal (combinatorics); Approximation algorithm; Discrete mathematics; Undirected graph; Graph; Minimum weight; Time complexity; Independent set","score_opus":0.018321825107868304,"score_gpt":0.2553436650242999,"score_spread":0.23702183991643158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3201703753","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52847826,0.00050521526,0.44747016,0.0025979185,0.003394224,0.0015484574,0.00058332755,0.0008796486,0.014542817],"genre_scores_gemma":[0.68502045,0.00015058619,0.31070134,0.0027477874,0.00021676101,0.00015467423,0.0005921153,0.000064719185,0.00035157954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968287,0.00007796415,0.0011955819,0.0004272423,0.0005574621,0.0009131009],"domain_scores_gemma":[0.9979405,0.00027372094,0.0003264517,0.0010033755,0.00024893426,0.00020706505],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006306947,0.00039026616,0.00051197736,0.0004785435,0.00037315008,0.00052572467,0.0014980485,0.00020790487,0.00003154657],"category_scores_gemma":[0.00010678261,0.00038875517,0.0003147426,0.0011497928,0.000113274495,0.0017300366,0.0005816931,0.0005484378,0.000073980635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001255542,0.0017955517,0.055888485,0.0014468165,0.000521706,0.0003611285,0.036234837,0.00027207722,0.00042414884,0.70291007,0.009344611,0.19067502],"study_design_scores_gemma":[0.010894542,0.00046080002,0.025024245,0.001259537,0.00006870501,0.00070662476,0.004930963,0.58108777,0.007861921,0.21026047,0.15445267,0.0029917809],"about_ca_topic_score_codex":0.00003274556,"about_ca_topic_score_gemma":0.00011003052,"teacher_disagreement_score":0.5808157,"about_ca_system_score_codex":0.00009967203,"about_ca_system_score_gemma":0.00014421335,"threshold_uncertainty_score":0.9998564},"labels":[],"label_agreement":null},{"id":"W3202345783","doi":"10.4230/lipics.approx/random.2021.13","title":"Secretary Matching Meets Probing with Commitment","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Bipartite graph; Matching (statistics); Competitive analysis; Combinatorics; Knapsack problem; Secretary problem; Online algorithm; Order (exchange); Stochastic block model; Generalization; Set (abstract data type); Time complexity; Mathematics; Context (archaeology); Oracle; Matroid; Discrete mathematics; Computer science; Algorithm; Mathematical optimization; Graph; Upper and lower bounds; Artificial intelligence","score_opus":0.016288179103186976,"score_gpt":0.2455387204149818,"score_spread":0.22925054131179481,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202345783","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01720513,0.00008357462,0.9662377,0.0026256873,0.000477699,0.0012164185,0.000083088446,0.00038534586,0.01168531],"genre_scores_gemma":[0.3477346,0.000111135385,0.64436024,0.0050331443,0.00011627484,0.0002621934,0.0007295569,0.00007213479,0.0015807354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975087,0.00006764115,0.0007488199,0.00032463425,0.00063210184,0.00071811007],"domain_scores_gemma":[0.99808365,0.000102553124,0.0002670375,0.00085854705,0.00042803067,0.00026019447],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053243747,0.00032018675,0.0003574642,0.00016938122,0.00047428778,0.0008518506,0.0009252624,0.00011679075,0.000050858216],"category_scores_gemma":[0.000029632723,0.00026609973,0.0001396191,0.00047366938,0.00006749956,0.0021294055,0.0006017448,0.0003775616,0.00008484241],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039563538,0.003325183,0.009416826,0.0057941712,0.0021294923,0.00042905207,0.18677759,0.08609556,0.0011439327,0.5434205,0.020848801,0.14022325],"study_design_scores_gemma":[0.0076162824,0.000676015,0.00039491119,0.0008291289,0.000058474903,0.00053509505,0.0032593259,0.7433062,0.004822815,0.0037295572,0.23323764,0.0015345636],"about_ca_topic_score_codex":0.000010169092,"about_ca_topic_score_gemma":0.000027449327,"teacher_disagreement_score":0.65721065,"about_ca_system_score_codex":0.00010842364,"about_ca_system_score_gemma":0.00022054849,"threshold_uncertainty_score":0.99997914},"labels":[],"label_agreement":null},{"id":"W3203056386","doi":"10.4230/lipics.time.2021.5","title":"Model Checking of Stream Processing Pipelines","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"Alpen-Adria-Universität Klagenfurt; LOEWE Zentrum AdRIA","keywords":"Computer science; Pipeline transport; Stream processing; Programming language; Model checking; Extension (predicate logic); Set (abstract data type); Computation; Distributed computing; Engineering","score_opus":0.0477818302484747,"score_gpt":0.31496843515858736,"score_spread":0.26718660491011265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3203056386","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04286149,0.00010823139,0.95163643,0.00015644962,0.00044400347,0.00038031515,0.00008346515,0.00018533015,0.004144265],"genre_scores_gemma":[0.3144772,0.000025211995,0.6848302,0.00028542112,0.00006036016,0.00004162984,0.00008090006,0.00002256288,0.00017652287],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973162,0.0000428942,0.0012630866,0.0002968738,0.00054446,0.00053648563],"domain_scores_gemma":[0.9972583,0.00007094825,0.00068602525,0.00096597394,0.0008895533,0.00012916616],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007894985,0.00029447334,0.00042562056,0.00019926978,0.00023224649,0.00031596122,0.0011589224,0.00018527394,0.000006797886],"category_scores_gemma":[0.00031705538,0.0002823039,0.00019997737,0.0005946378,0.000099092314,0.0026906077,0.00049684825,0.00028136792,0.000016831053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014396122,0.0013946154,0.0049582436,0.006078616,0.0002498122,0.00001240464,0.046767388,0.022892907,0.007575996,0.2930745,0.0020312318,0.61482036],"study_design_scores_gemma":[0.00080909947,0.00005764543,0.00017992599,0.00021209326,0.0000203269,0.000040632785,0.0006242603,0.9516626,0.040221624,0.0031935407,0.0026630496,0.00031517143],"about_ca_topic_score_codex":0.0000036784606,"about_ca_topic_score_gemma":0.0000046974587,"teacher_disagreement_score":0.9287697,"about_ca_system_score_codex":0.00008677561,"about_ca_system_score_gemma":0.00035084266,"threshold_uncertainty_score":0.9999629},"labels":[],"label_agreement":null},{"id":"W3206946486","doi":"10.4230/lipics.disc.2021.29","title":"Detectable Sequential Specifications for Recoverable Shared Objects","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Correctness; Linearizability; Cache; Thread (computing); Shared memory; State (computer science); Parallel computing; Cache coherence; Sequential consistency; Atomicity; Distributed computing; Programming language; CPU cache; Consistency model; Cache algorithms","score_opus":0.04403339357712774,"score_gpt":0.26483447846352914,"score_spread":0.2208010848864014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206946486","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066137575,0.00016744396,0.9777655,0.0005375107,0.0022614156,0.0014017326,0.0027797925,0.00029348794,0.0081793815],"genre_scores_gemma":[0.7359905,0.000078499346,0.24927229,0.0017846765,0.00072932715,0.0012946579,0.0039710216,0.000099866345,0.0067791375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99715793,0.000029015815,0.0010945251,0.00044686877,0.0004126938,0.0008589721],"domain_scores_gemma":[0.9971737,0.00018304418,0.00041316045,0.0011868401,0.000816877,0.00022636908],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004776861,0.0003391412,0.00047613482,0.00013444804,0.0005957697,0.0012104253,0.0011524764,0.00021190378,0.000058796548],"category_scores_gemma":[0.00019636453,0.00034221774,0.00035079775,0.0005689584,0.000045293116,0.0022810868,0.0002939959,0.0002461939,0.00015880135],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000610447,0.0035990493,0.0035626374,0.0071258764,0.0019774034,0.000103147395,0.037417926,0.0056045833,0.01518121,0.4126262,0.4052207,0.10697085],"study_design_scores_gemma":[0.004420276,0.00021832026,0.00025591973,0.00023966172,0.000044315235,0.00015217192,0.0010063214,0.2277308,0.01856115,0.0032203475,0.7432404,0.00091027445],"about_ca_topic_score_codex":0.000016060165,"about_ca_topic_score_gemma":0.000048198595,"teacher_disagreement_score":0.7293768,"about_ca_system_score_codex":0.00017940224,"about_ca_system_score_gemma":0.00027123356,"threshold_uncertainty_score":0.99990296},"labels":[],"label_agreement":null},{"id":"W3208459334","doi":"10.4230/lipics.disc.2021.36","title":"Extension-Based Proofs for Synchronous Message Passing","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Embedded Systems Design Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematical proof; Computer science; Extension (predicate logic); Message passing; Message broker; Distributed computing; Theoretical computer science; Programming language; Mathematics","score_opus":0.020686900519599927,"score_gpt":0.2743864207098398,"score_spread":0.2536995201902399,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3208459334","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051280945,0.00016788264,0.9871919,0.0006963898,0.0010252323,0.0023876533,0.00021504893,0.0009636335,0.0022241639],"genre_scores_gemma":[0.48656818,0.00000969447,0.50931877,0.0021929427,0.00019802121,0.00089277857,0.00031145674,0.000087211825,0.00042096185],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960531,0.00010571634,0.0015064081,0.00059611374,0.0006744443,0.0010642373],"domain_scores_gemma":[0.9956549,0.0005330843,0.0006594288,0.0018298659,0.0010500792,0.0002726861],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012153812,0.00053496135,0.0007255659,0.0003087705,0.0005659847,0.0009796859,0.0014990149,0.0003528174,0.00001635053],"category_scores_gemma":[0.0003808417,0.0005040984,0.00047268014,0.00052952056,0.00010646173,0.0018210716,0.0004367749,0.00036931058,0.00005174445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006696521,0.0049548964,0.0050280457,0.021299679,0.001597116,0.00050875713,0.03655842,0.0023372897,0.024643987,0.26645827,0.19510572,0.44083816],"study_design_scores_gemma":[0.0051794415,0.0007575975,0.0002166469,0.0013324344,0.00009216171,0.00031318064,0.00074654416,0.7370398,0.11876864,0.0070644403,0.12675603,0.0017330848],"about_ca_topic_score_codex":0.000007854315,"about_ca_topic_score_gemma":0.0000123634345,"teacher_disagreement_score":0.7347025,"about_ca_system_score_codex":0.00031387468,"about_ca_system_score_gemma":0.00055526686,"threshold_uncertainty_score":0.9997411},"labels":[],"label_agreement":null},{"id":"W3209321351","doi":"10.4230/lipics.disc.2021.43","title":"Brief Announcement: Fast Graphical Population Protocols","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Pairwise comparison; Population; Clique; Graph; Leader election; Discrete mathematics; Computer science; Line graph; Quadratic equation; Node (physics); Mathematics; Combinatorics; Theoretical computer science; Statistics","score_opus":0.015868861208871623,"score_gpt":0.2771996097140464,"score_spread":0.2613307485051748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3209321351","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023493031,0.000056399764,0.9548397,0.0009566156,0.0013043423,0.010325377,0.0011915197,0.00048140239,0.0073515787],"genre_scores_gemma":[0.9469112,0.00001662383,0.03900338,0.0025477787,0.0004183064,0.006828457,0.003182979,0.000061773426,0.0010295142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99673676,0.000059574035,0.0012811477,0.0004169813,0.0007542063,0.00075129914],"domain_scores_gemma":[0.9975798,0.0000549057,0.00045003902,0.0011037025,0.0005710972,0.00024041481],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052255066,0.00036288457,0.00048626933,0.00014472673,0.00040653208,0.0010161283,0.0010367404,0.00023127341,0.000024641373],"category_scores_gemma":[0.0000817535,0.00034022675,0.00028073642,0.00074280985,0.00006138911,0.0021687436,0.0003895063,0.00033930133,0.000084906],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002683831,0.0029251897,0.075717665,0.0039926236,0.0006659052,0.00014472155,0.013909812,0.0011293894,0.0007024187,0.71056986,0.051268704,0.13870536],"study_design_scores_gemma":[0.0059392937,0.00037690255,0.014108972,0.00073194737,0.000028038023,0.00026873345,0.0005701932,0.15142843,0.0010414275,0.0033069185,0.82098925,0.0012098792],"about_ca_topic_score_codex":0.000024971298,"about_ca_topic_score_gemma":0.00002566667,"teacher_disagreement_score":0.92341816,"about_ca_system_score_codex":0.000117527205,"about_ca_system_score_gemma":0.000118459924,"threshold_uncertainty_score":0.999905},"labels":[],"label_agreement":null},{"id":"W3209486183","doi":"10.4230/lipics.cp.2021.35","title":"Counterfactual Explanations via Inverse Constraint Programming","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Explainable Artificial Intelligence (XAI)","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Counterfactual thinking; Constraint programming; Mathematical optimization; Inverse; Computer science; Scheduling (production processes); Constraint (computer-aided design); Integer programming; Knapsack problem; Mathematics; Stochastic programming","score_opus":0.02717998728889445,"score_gpt":0.27272963290072283,"score_spread":0.24554964561182838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3209486183","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042606764,0.00004158208,0.94802547,0.0010177402,0.0013477267,0.0009454615,0.00017421902,0.0004387314,0.005402307],"genre_scores_gemma":[0.8224443,0.00003556267,0.17321566,0.0027308902,0.00019116011,0.00026855097,0.00046137764,0.000052670235,0.00059979904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965941,0.000061878556,0.0012312025,0.000437761,0.0006542313,0.0010208705],"domain_scores_gemma":[0.9971167,0.00026271518,0.0003879203,0.0010565743,0.0008497047,0.00032642743],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006379563,0.0004076591,0.0004196622,0.00027247923,0.0005871327,0.0010294999,0.001274295,0.00021930871,0.00011609885],"category_scores_gemma":[0.00028942415,0.000415092,0.00025722972,0.0007016713,0.00023206064,0.0029786888,0.00056705915,0.00044701967,0.00055916165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013606409,0.002465169,0.004764265,0.0013460163,0.00089756784,0.00039499332,0.10992014,0.0028886667,0.0028120775,0.46117958,0.024408095,0.38878736],"study_design_scores_gemma":[0.0022385798,0.00048270397,0.0001513038,0.0002906617,0.00007424514,0.0007234556,0.021099133,0.47216654,0.062164623,0.0074331877,0.43146485,0.0017107121],"about_ca_topic_score_codex":0.000037201728,"about_ca_topic_score_gemma":0.00019613936,"teacher_disagreement_score":0.77983755,"about_ca_system_score_codex":0.00024389593,"about_ca_system_score_gemma":0.00034579358,"threshold_uncertainty_score":0.99983007},"labels":[],"label_agreement":null},{"id":"W3210396263","doi":"10.4230/lipics.cp.2021.3","title":"Learning in Local Branching (Invited Talk)","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Archaeological and Geological Studies","field":"Arts and Humanities","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Branching (polymer chemistry); Computer science; Artificial intelligence; Materials science","score_opus":0.023691300634289637,"score_gpt":0.22905651769632265,"score_spread":0.205365217062033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3210396263","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9270906,0.00043882668,0.006740933,0.004637287,0.0009957672,0.0006919522,0.00019258414,0.0003671574,0.058844883],"genre_scores_gemma":[0.99115187,0.000091536764,0.00061369396,0.00449307,0.00028916262,0.00007381698,0.00032708392,0.000020464002,0.0029393097],"study_design_codex":"qualitative","study_design_gemma":"not_applicable","domain_scores_codex":[0.99787194,0.00006533976,0.00082484994,0.00024144401,0.00027632847,0.0007200831],"domain_scores_gemma":[0.99897015,0.0002618062,0.00018476254,0.00019707356,0.00026702523,0.00011916603],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000325998,0.00030894045,0.0005013622,0.00011187609,0.00070571346,0.00017494783,0.00027422872,0.0001444566,0.00093577075],"category_scores_gemma":[0.00032492983,0.0002312377,0.0002290755,0.00011843152,0.0005794574,0.00052063155,0.00050994067,0.00066078594,0.00015061883],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000690178,0.0018564239,0.07111911,0.0018345466,0.0006890071,0.00037235778,0.41372472,0.0033999041,0.00007386123,0.279807,0.01529286,0.21114005],"study_design_scores_gemma":[0.0022642037,0.00038907366,0.0028170908,0.00016660076,0.000026991358,0.000030639334,0.037113033,0.007852121,0.00014979039,0.009332072,0.9392695,0.00058891025],"about_ca_topic_score_codex":0.00008875249,"about_ca_topic_score_gemma":0.0012266524,"teacher_disagreement_score":0.9239766,"about_ca_system_score_codex":0.00006314229,"about_ca_system_score_gemma":0.00001974358,"threshold_uncertainty_score":0.9999775},"labels":[],"label_agreement":null},{"id":"W3216294916","doi":"10.4230/lipics.isaac.2021.61","title":"Dynamic Boolean Formula Evaluation.","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Boolean function; Theoretical computer science; Algorithm","score_opus":0.027566407644740696,"score_gpt":0.32531156849104576,"score_spread":0.29774516084630503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3216294916","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029081829,0.00015253016,0.95526373,0.0004859836,0.0019160231,0.0011736224,0.00013368357,0.00034013664,0.011452438],"genre_scores_gemma":[0.21039066,0.00004982091,0.78649247,0.0014259167,0.00008319342,0.0002884485,0.0005797826,0.00004549023,0.000644223],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99630165,0.00014524814,0.0012619557,0.00044172074,0.0010602839,0.00078911544],"domain_scores_gemma":[0.99621266,0.00014996002,0.0005193962,0.0017754572,0.0011161654,0.00022633652],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021725371,0.00038431984,0.00040730677,0.00026150013,0.0004411274,0.00065802474,0.0015449723,0.00024666043,0.000078430545],"category_scores_gemma":[0.0006340362,0.00038022784,0.00028916518,0.00071020203,0.0000926888,0.0034060008,0.0006060548,0.0004082095,0.0003107829],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010983486,0.0009707429,0.0016348651,0.0012088389,0.00045447014,0.000019909583,0.01989094,0.0025525594,0.0011562062,0.41703662,0.00886932,0.5460957],"study_design_scores_gemma":[0.0020737415,0.00013370407,0.0013559749,0.00009268707,0.000049040296,0.00013738952,0.0006293926,0.92312443,0.004603452,0.00742251,0.0598244,0.00055328856],"about_ca_topic_score_codex":0.000004190314,"about_ca_topic_score_gemma":0.000014057934,"teacher_disagreement_score":0.92057186,"about_ca_system_score_codex":0.00037701012,"about_ca_system_score_gemma":0.00035317094,"threshold_uncertainty_score":0.99986494},"labels":[],"label_agreement":null},{"id":"W3216398592","doi":"10.20382/jocg.v14i1a1","title":"Approximating Longest Spanning Tree with Neighborhoods","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Spanning tree; Computer science; Minimum spanning tree; Tree (set theory); Combinatorics; Mathematics; Algorithm","score_opus":0.01329564247200219,"score_gpt":0.23161460095429337,"score_spread":0.2183189584822912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3216398592","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012959318,0.000067662,0.95346564,0.00079569855,0.0006727446,0.00064175995,0.00013062263,0.00041929173,0.030847287],"genre_scores_gemma":[0.19691329,0.00003818648,0.79668546,0.0024084528,0.0003970533,0.00017352721,0.0012338951,0.00008541572,0.0020647345],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970859,0.000035747635,0.0009023024,0.0004498102,0.0006463642,0.0008798692],"domain_scores_gemma":[0.997668,0.00011065008,0.00044095053,0.001282812,0.00028628175,0.00021129756],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00056479726,0.00042301466,0.0004537828,0.00021659855,0.00042182102,0.0015149119,0.0015519528,0.00011749793,0.000027051223],"category_scores_gemma":[0.000087003165,0.00036017637,0.00016369842,0.00075564074,0.00008240934,0.0041467217,0.001089376,0.00036458138,0.000115923685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012474059,0.001393213,0.028547294,0.002781,0.001145928,0.00037413262,0.022324502,0.0009135848,0.00015440314,0.23018448,0.018048247,0.69400847],"study_design_scores_gemma":[0.006739668,0.0005947847,0.0030278042,0.0006923493,0.00013156448,0.0003299784,0.004339641,0.7951546,0.0031123173,0.0018638584,0.18212901,0.001884465],"about_ca_topic_score_codex":0.0000071983454,"about_ca_topic_score_gemma":0.000020758062,"teacher_disagreement_score":0.79424095,"about_ca_system_score_codex":0.00007630858,"about_ca_system_score_gemma":0.00010704754,"threshold_uncertainty_score":0.999885},"labels":[],"label_agreement":null},{"id":"W3217470394","doi":"10.4230/lipics.isaac.2021.16","title":"Efficiently Partitioning the Edges of a 1-Planar Graph into a Planar Graph and a Forest","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Planar graph; Planar straight-line graph; Outerplanar graph; Book embedding; Edge contraction; Combinatorics; Planar; Graph; Mathematics; Discrete mathematics; Computer science; 1-planar graph; Pathwidth; Line graph; Voltage graph","score_opus":0.012951347721054173,"score_gpt":0.23663351082266498,"score_spread":0.22368216310161082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3217470394","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25124294,0.00030026902,0.7461202,0.00087377214,0.00042714356,0.00039905988,0.00008625608,0.00006205399,0.00048831984],"genre_scores_gemma":[0.957498,0.00006634332,0.040989153,0.0008763828,0.00008747057,0.00007025765,0.00032650406,0.000012422855,0.000073438634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831706,0.000052114305,0.00066436565,0.00023001412,0.00040142002,0.00033501367],"domain_scores_gemma":[0.9985267,0.00025994604,0.00029033804,0.0004477547,0.00036361165,0.00011168214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048364475,0.00020625615,0.0002562003,0.00023954514,0.00047074823,0.00033335152,0.0004808594,0.00008619491,0.0000050861822],"category_scores_gemma":[0.00010700602,0.00016368978,0.00014908859,0.00073503616,0.00012937872,0.0007529464,0.00016708528,0.00017512367,0.000009706685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002111359,0.0010661649,0.02659022,0.0019486037,0.00076303224,0.00003686962,0.063639015,0.017644493,0.0017412283,0.787094,0.014304073,0.08496118],"study_design_scores_gemma":[0.012622287,0.0019114438,0.04830895,0.0012850369,0.00035349163,0.0011913081,0.009968482,0.55052376,0.049870018,0.19557685,0.12563972,0.002748664],"about_ca_topic_score_codex":0.00001743061,"about_ca_topic_score_gemma":0.00009904891,"teacher_disagreement_score":0.7062551,"about_ca_system_score_codex":0.000024900291,"about_ca_system_score_gemma":0.00010740292,"threshold_uncertainty_score":0.6675076},"labels":[],"label_agreement":null},{"id":"W4221140426","doi":"10.4230/lipics.swat.2022.19","title":"An Optimal Algorithm for Product Structure in Planar Graphs","year":2022,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University","funders":"","keywords":"Mathematics; Combinatorics; Planar graph; Product (mathematics); Planar; Graph; Path (computing); Discrete mathematics; Time complexity; Treewidth; Algorithm; Pathwidth; Computer science; Geometry; Line graph","score_opus":0.019428817194095484,"score_gpt":0.3105806399749501,"score_spread":0.2911518227808546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4221140426","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057838365,0.00027130335,0.9198029,0.0003019128,0.0026469287,0.007853805,0.010423737,0.0005063909,0.00035462613],"genre_scores_gemma":[0.07930775,0.000103149825,0.90907824,0.00065738236,0.00038236528,0.002706435,0.0073441905,0.00020525878,0.0002152187],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9937928,0.00019869758,0.0017525498,0.001273241,0.0012323981,0.0017503316],"domain_scores_gemma":[0.9947944,0.00028228018,0.0008460514,0.0031760416,0.0004945863,0.0004066021],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00174146,0.0009670828,0.0010977592,0.0014835215,0.00061735144,0.00089076866,0.0063502644,0.0004865345,0.00006301278],"category_scores_gemma":[0.00014431486,0.0009630512,0.0005385356,0.00090807205,0.0002439583,0.0023873558,0.0027118968,0.002557035,0.000009477567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017751527,0.002904627,0.0046522794,0.008205706,0.0014639663,0.00015637816,0.052080695,0.08449453,0.0003060829,0.16864556,0.00821557,0.6670995],"study_design_scores_gemma":[0.0051437384,0.0012628312,0.0005132166,0.00026296385,0.000054239674,0.0001203783,0.0018270653,0.82055867,0.0014227823,0.11796801,0.048538815,0.002327286],"about_ca_topic_score_codex":0.000022629727,"about_ca_topic_score_gemma":0.000027193355,"teacher_disagreement_score":0.73606414,"about_ca_system_score_codex":0.00044383964,"about_ca_system_score_gemma":0.00046391904,"threshold_uncertainty_score":0.9997441},"labels":[],"label_agreement":null},{"id":"W4221160784","doi":"10.4230/lipics.ecoop.2022.13","title":"REST: Integrating Term Rewriting with Program Verification","year":2022,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Haskell; Rewriting; Mathematical proof; Computer science; Lemma (botany); Rest (music); Term (time); Programming language; Functional programming; Implementation; Gas meter prover; Algorithm; Theoretical computer science; Mathematics","score_opus":0.026357473301668842,"score_gpt":0.28385608241737076,"score_spread":0.25749860911570194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4221160784","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044034753,0.00026387873,0.90569866,0.00050349283,0.0042105764,0.009661936,0.00022427105,0.0027631235,0.032639287],"genre_scores_gemma":[0.85944533,0.00003677966,0.13381158,0.0003294413,0.0004249293,0.0033289874,0.002007236,0.00010595009,0.0005097586],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9950904,0.000142087,0.0017899221,0.0008427763,0.0010543052,0.0010805015],"domain_scores_gemma":[0.9951173,0.00014403166,0.0017897341,0.0021752731,0.00052166684,0.00025200978],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001528536,0.00078400155,0.0008255186,0.00041529667,0.0008574732,0.0022575709,0.0031380625,0.0004568729,0.000023832647],"category_scores_gemma":[0.00014902336,0.0006542801,0.00037863743,0.00054390886,0.00015491417,0.0013061666,0.002485106,0.001796864,0.000047402762],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026921116,0.0018850458,0.025211224,0.010256315,0.0010516735,0.00009353142,0.07215897,0.0011690275,0.000055358178,0.38179177,0.0039419164,0.50211596],"study_design_scores_gemma":[0.0070958086,0.00406159,0.0040933415,0.0013878571,0.0003211581,0.0006251123,0.015338789,0.3376693,0.0006689646,0.014085092,0.60913914,0.0055138697],"about_ca_topic_score_codex":0.000101984624,"about_ca_topic_score_gemma":0.000051808776,"teacher_disagreement_score":0.8154106,"about_ca_system_score_codex":0.00043344588,"about_ca_system_score_gemma":0.0003763919,"threshold_uncertainty_score":0.9995909},"labels":[],"label_agreement":null},{"id":"W4225547311","doi":"10.4230/lipics.socg.2022.42","title":"Robust Radical Sylvester-Gallai Theorem for Quadratics","year":2022,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Generalization; Dimension (graph theory); Mathematics; Polynomial; Discrete mathematics; Mathematical analysis","score_opus":0.025147154245618777,"score_gpt":0.23528827382658862,"score_spread":0.21014111958096984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225547311","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30253068,0.0013053401,0.59704417,0.00035138082,0.025186388,0.015794195,0.020386057,0.0033932936,0.034008525],"genre_scores_gemma":[0.95529485,0.00027401253,0.02347866,0.0007754102,0.0015371661,0.005573319,0.010857511,0.00073074346,0.0014783135],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9949942,0.000109353015,0.0023740544,0.0004992415,0.00072876015,0.0012943662],"domain_scores_gemma":[0.99677396,0.00043742105,0.0006004897,0.0015890513,0.00021668847,0.0003823948],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015347776,0.0011252961,0.0013779721,0.00049186207,0.00055591116,0.00060843595,0.0017911397,0.0009426011,0.00026679557],"category_scores_gemma":[0.000123417,0.0011204854,0.001106717,0.00025338645,0.00022623497,0.000534952,0.000864801,0.0018448541,0.00007026916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012927123,0.0013096149,0.0025109383,0.058198944,0.006154232,0.00004474085,0.053714763,0.49631947,0.0001898445,0.2633648,0.1061515,0.0107484395],"study_design_scores_gemma":[0.0053497083,0.00052176503,0.000096214775,0.0010615245,0.00053004816,0.0001263279,0.006507394,0.44132555,0.00055425713,0.02064841,0.5202413,0.0030375114],"about_ca_topic_score_codex":0.0000072402145,"about_ca_topic_score_gemma":0.000015041322,"teacher_disagreement_score":0.6527642,"about_ca_system_score_codex":0.00041547645,"about_ca_system_score_gemma":0.00013757222,"threshold_uncertainty_score":0.9991245},"labels":[],"label_agreement":null},{"id":"W4226124909","doi":"10.4230/lipics.fun.2026.23","title":"Combinatorial Gray codes-an updated survey","year":2022,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Gray code; Computer science; Gray (unit); Combinatorics; Vertex (graph theory); Class (philosophy); Theoretical computer science; Graph; Mathematics; Algorithm; Artificial intelligence","score_opus":0.029575244443663298,"score_gpt":0.2819583446586847,"score_spread":0.2523831002150214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226124909","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6739858,0.00038334235,0.20380846,0.0009790008,0.08216008,0.009199804,0.015780028,0.0047045765,0.008998951],"genre_scores_gemma":[0.93542075,0.00006548405,0.03050386,0.0016322148,0.0001642178,0.00059789716,0.031028053,0.00018483176,0.0004027007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99327284,0.00049545075,0.0023410548,0.0010505541,0.0015023814,0.0013377325],"domain_scores_gemma":[0.9933719,0.00025259162,0.0014202943,0.0034235264,0.00094423373,0.00058746105],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0040034247,0.0010347534,0.0012664321,0.0007373409,0.00097411865,0.001642181,0.005242837,0.00074150105,0.00015313602],"category_scores_gemma":[0.00017433135,0.0010062364,0.0005811047,0.00081493077,0.00020317509,0.0014861667,0.005543718,0.0022689742,0.00012582281],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009909904,0.005382961,0.029853981,0.0027788621,0.002319708,0.000059005208,0.027386203,0.015190986,0.00010234741,0.7360554,0.17138067,0.008498905],"study_design_scores_gemma":[0.01598722,0.0023769685,0.0047687837,0.00050085376,0.00031647025,0.00013276435,0.00091445073,0.50966525,0.000729218,0.24619806,0.21217063,0.0062393337],"about_ca_topic_score_codex":0.00052924635,"about_ca_topic_score_gemma":0.00007455713,"teacher_disagreement_score":0.49447426,"about_ca_system_score_codex":0.00027840422,"about_ca_system_score_gemma":0.00054666144,"threshold_uncertainty_score":0.99939424},"labels":[],"label_agreement":null},{"id":"W4226530376","doi":"10.4230/lipics.socg.2022.71","title":"Conflict-Based Local Search for Minimum Partition into Plane Subgraphs (CG Challenge)","year":2022,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Agence Nationale de la Recherche","keywords":"Partition (number theory); Plane (geometry); Combinatorics; Partition problem; Line segment; Mathematics; Set (abstract data type); Computer science; Line (geometry); Geometry","score_opus":0.03651706458180236,"score_gpt":0.2986221419772685,"score_spread":0.2621050773954661,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226530376","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023747183,0.0002113756,0.9664146,0.0014571449,0.0025391316,0.0030041237,0.0014488483,0.00031141556,0.00086621713],"genre_scores_gemma":[0.8782885,0.00011756807,0.09468743,0.0020788522,0.0006181307,0.0026565983,0.021058775,0.00009522233,0.00039892338],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99570274,0.00012469436,0.0014778951,0.0007422492,0.0010906121,0.0008617851],"domain_scores_gemma":[0.9966777,0.0005058032,0.00064458756,0.0011665992,0.00069594855,0.00030936897],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014026995,0.00063569105,0.00068757805,0.0008180172,0.0007645535,0.00068859325,0.0018367463,0.00046818733,0.00008118853],"category_scores_gemma":[0.00006166517,0.0006796911,0.00056506315,0.0004645865,0.00014680006,0.0007902076,0.0013633212,0.00094388786,0.000048266338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001490503,0.002821557,0.00072153605,0.012476081,0.001181874,0.000031289583,0.04079827,0.61844903,0.00018929395,0.1556375,0.031219885,0.13498315],"study_design_scores_gemma":[0.0028913387,0.00076786283,0.000100181336,0.00015018265,0.00005457596,0.000013209329,0.0006084225,0.8386733,0.0016897208,0.003972633,0.15024956,0.0008290451],"about_ca_topic_score_codex":0.000041791824,"about_ca_topic_score_gemma":0.000039582334,"teacher_disagreement_score":0.8717271,"about_ca_system_score_codex":0.00037196913,"about_ca_system_score_gemma":0.0006263644,"threshold_uncertainty_score":0.9995654},"labels":[],"label_agreement":null},{"id":"W4280619266","doi":"10.4230/lipics.itp.2022.18","title":"Automatic Test-Case Reduction in Proof Assistants: A Case Study in Coq","year":2022,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Prevention of Organ Failure","funders":"","keywords":"Computer science; Reduction (mathematics); Test (biology); Proof assistant; Proof of concept; Programming language; Operating system; Mathematics; Mathematical proof","score_opus":0.02613850071469267,"score_gpt":0.29371747690243355,"score_spread":0.2675789761877409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4280619266","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9715615,0.000024498102,0.022183029,0.000120509576,0.0005464756,0.00261789,0.00009699233,0.0026443733,0.00020476966],"genre_scores_gemma":[0.9599725,9.1795107e-7,0.038543887,0.00015983902,0.000029013998,0.0011933314,0.000028732155,0.000033192802,0.000038579703],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966213,0.0001795942,0.0014813658,0.00043412487,0.0005879138,0.0006956769],"domain_scores_gemma":[0.99769294,0.00047520624,0.00048598563,0.0010805717,0.00013534476,0.0001299535],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022150115,0.00036085225,0.00046720606,0.0009027749,0.0005223856,0.00036862504,0.00096872234,0.00010026547,0.00001676452],"category_scores_gemma":[0.00056683196,0.0003674492,0.00011294242,0.0014309955,0.00006132442,0.0013057425,0.00092353363,0.0007238576,0.000008607249],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108826236,0.012821591,0.5397379,0.0013596666,0.00015175028,0.047725197,0.17029272,0.0015437746,0.00002424353,0.0007517342,0.011247312,0.21423532],"study_design_scores_gemma":[0.0056073107,0.0022571418,0.0040364694,0.00023667057,0.000031458876,0.09849019,0.014130689,0.86991376,0.0000844795,0.0034712313,0.0006969973,0.0010436234],"about_ca_topic_score_codex":0.00056856044,"about_ca_topic_score_gemma":0.00019686569,"teacher_disagreement_score":0.86836994,"about_ca_system_score_codex":0.00059927464,"about_ca_system_score_gemma":0.00017409313,"threshold_uncertainty_score":0.99987775},"labels":[],"label_agreement":null},{"id":"W4281858785","doi":"10.4230/lipics.aofa.2022.13","title":"Mean Field Analysis of an Incentive Algorithm for a Closed Stochastic Network","year":2022,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Field (mathematics); Incentive; Algorithm; Mathematics; Economics","score_opus":0.01503601822912607,"score_gpt":0.2701443491793923,"score_spread":0.2551083309502662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281858785","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07100648,0.00007657806,0.9196736,0.00011892002,0.0017409628,0.0032063632,0.0026326643,0.00030010464,0.0012443204],"genre_scores_gemma":[0.87994075,0.000026290143,0.07326869,0.004422771,0.0030276508,0.0021818222,0.036324162,0.00033338263,0.00047448525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953646,0.000052215088,0.0021428782,0.0006917932,0.0007699215,0.0009785902],"domain_scores_gemma":[0.9939804,0.0005641174,0.003040024,0.001489575,0.00085631973,0.0000695772],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001742447,0.00081961293,0.0018594352,0.0016568346,0.00066577585,0.00047513517,0.0016917851,0.00043776515,0.00041882036],"category_scores_gemma":[0.0003454744,0.00084904634,0.0016578992,0.001810134,0.00014154853,0.0016915698,0.0021625038,0.0009450592,0.000014168823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012279436,0.0009801412,0.0009608259,0.00313585,0.015116875,0.000007810251,0.004472312,0.8827945,0.0000060193793,0.02787538,0.001900817,0.0615215],"study_design_scores_gemma":[0.0017021308,0.00011831421,0.00011269322,0.00019062453,0.0070865927,7.544639e-7,0.0027740563,0.9591404,0.00001597662,0.017250448,0.010676379,0.00093160244],"about_ca_topic_score_codex":0.00021092551,"about_ca_topic_score_gemma":0.0002527927,"teacher_disagreement_score":0.8464049,"about_ca_system_score_codex":0.00023341311,"about_ca_system_score_gemma":0.00008463495,"threshold_uncertainty_score":0.999396},"labels":[],"label_agreement":null},{"id":"W4283124407","doi":"10.4230/lipics.approx/random.2022.18","title":"Sketching Distances in Monotone Graph Classes","year":2022,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Agence Nationale de la Recherche","keywords":"Monotone polygon; Computer science; Graph; Theoretical computer science; Combinatorics; Mathematics; Geometry","score_opus":0.02570291299465333,"score_gpt":0.3180068150081586,"score_spread":0.29230390201350526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283124407","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2016374,0.0007226366,0.77951986,0.00066078047,0.002972199,0.0042063775,0.0014193784,0.00071251934,0.008148863],"genre_scores_gemma":[0.8936199,0.0008017217,0.099618964,0.0009087009,0.00022704889,0.0026884244,0.0012963071,0.00017740806,0.00066155405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99362105,0.00025773112,0.0020522627,0.0009752339,0.0014656885,0.0016280427],"domain_scores_gemma":[0.99515855,0.0006121088,0.0010111656,0.0026112685,0.0002805377,0.0003263869],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.002096372,0.0008905532,0.0011154357,0.001517248,0.0006377005,0.0011143903,0.006067426,0.0004339736,0.00006694419],"category_scores_gemma":[0.0002509197,0.0008941207,0.0006221947,0.0012444023,0.00029541962,0.002571968,0.0074542407,0.0032096677,0.000042422667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011194524,0.0028122233,0.049919084,0.009980984,0.0012248667,0.0002922027,0.0652428,0.056884773,0.00013424839,0.722733,0.005375316,0.08428105],"study_design_scores_gemma":[0.0065353406,0.0007171458,0.0036950263,0.0013851024,0.000068648085,0.00009270594,0.0069298996,0.24042055,0.000795833,0.59661937,0.13858949,0.0041508833],"about_ca_topic_score_codex":0.000058038764,"about_ca_topic_score_gemma":0.00009774502,"teacher_disagreement_score":0.69198245,"about_ca_system_score_codex":0.0005843322,"about_ca_system_score_gemma":0.0003551953,"threshold_uncertainty_score":0.9999226},"labels":[],"label_agreement":null},{"id":"W4283330479","doi":"10.4230/lipics.icalp.2022.81","title":"A Study of Weisfeiler-Leman Colorings on Planar Graphs","year":2022,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Bipartite graph; Mathematics; Graph isomorphism; Discrete mathematics; Planar graph; Isomorphism (crystallography); Subgraph isomorphism problem; Line graph; Chordal graph; Pathwidth; Graph","score_opus":0.040270605147283325,"score_gpt":0.3205178733126442,"score_spread":0.2802472681653609,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283330479","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9450822,0.00006279453,0.03190287,0.00024082822,0.0022652883,0.0082161,0.00170867,0.00058737077,0.009933879],"genre_scores_gemma":[0.98485535,0.00005739744,0.011571709,0.00041948014,0.000076839926,0.0019719785,0.0004767748,0.00011678421,0.0004537091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99312514,0.00027157099,0.0021930884,0.00097146037,0.0021443637,0.001294387],"domain_scores_gemma":[0.99353606,0.0005842312,0.0014778455,0.0035684824,0.00047161587,0.0003617817],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0018653256,0.00092165783,0.0013358885,0.0016356863,0.00065351406,0.00043806504,0.0064991903,0.00037679146,0.000074257405],"category_scores_gemma":[0.00017830434,0.00089935085,0.0006316614,0.0010551609,0.00024129401,0.0010162089,0.005876051,0.0025685118,0.000043812255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032242632,0.016988343,0.035728067,0.008116994,0.0044146646,0.0003391826,0.16732663,0.022477748,0.00012112057,0.7110922,0.01185435,0.018316437],"study_design_scores_gemma":[0.052434895,0.045652043,0.019021923,0.0034638662,0.0007857468,0.00035135608,0.091614105,0.10261589,0.003133522,0.4374449,0.23048593,0.012995814],"about_ca_topic_score_codex":0.000054541433,"about_ca_topic_score_gemma":0.000030101752,"teacher_disagreement_score":0.2736473,"about_ca_system_score_codex":0.00036259618,"about_ca_system_score_gemma":0.00026202924,"threshold_uncertainty_score":0.9997326},"labels":[],"label_agreement":null},{"id":"W4285580083","doi":"10.4230/lipics.sea.2022.16","title":"RLBWT Tricks","year":2021,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"National Institute of Allergy and Infectious Diseases; National Human Genome Research Institute","keywords":"Row; Permutation (music); Table (database); Constant (computer programming); Computer science; Speedup; Limiting; Algorithm; Rank (graph theory); Compression (physics); Computation; Combinatorics; Parallel computing; Mathematics; Database; Physics; Programming language","score_opus":0.020076732669350592,"score_gpt":0.2675891314586799,"score_spread":0.24751239878932932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285580083","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009745549,0.00044951044,0.97512114,0.000436484,0.005697501,0.0014699543,0.0011837999,0.0005579318,0.0053381193],"genre_scores_gemma":[0.19241466,0.00083213346,0.785697,0.004499148,0.0016123469,0.0009232583,0.011902999,0.00023052655,0.0018879402],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99504757,0.0000831346,0.0018252253,0.000867002,0.0010655543,0.0011115316],"domain_scores_gemma":[0.9943733,0.00019074132,0.0010395206,0.003314693,0.00066021195,0.00042148936],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.000746536,0.00087703665,0.0010657541,0.00044716764,0.00047135746,0.0025730578,0.0044430746,0.0008618176,0.00007144699],"category_scores_gemma":[0.00014265024,0.0007935391,0.00070442137,0.0004553123,0.00010738934,0.0025045061,0.0087770065,0.0016286548,0.00016009946],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025478285,0.0031621621,0.0026292182,0.009851505,0.0019736178,0.00030546286,0.048850607,0.0036828015,0.0001224945,0.039575227,0.18502611,0.704566],"study_design_scores_gemma":[0.0032181877,0.00022422096,0.00048660822,0.0012322973,0.00010059479,0.00015646762,0.00092314184,0.6031,0.0009097628,0.0031315645,0.38452768,0.0019894377],"about_ca_topic_score_codex":0.000059721904,"about_ca_topic_score_gemma":0.000011251079,"teacher_disagreement_score":0.7025766,"about_ca_system_score_codex":0.00023599622,"about_ca_system_score_gemma":0.00048152177,"threshold_uncertainty_score":0.9994516},"labels":[],"label_agreement":null},{"id":"W4287548900","doi":"10.4230/lipics.aft.2023.27","title":"Liquidity Management Attacks on Lending Markets","year":2023,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Incentive; Implementation; Executable; Context (archaeology); Variety (cybernetics); Computer science; Microeconomics; Economics; Artificial intelligence; Software engineering; Programming language","score_opus":0.033896532246055905,"score_gpt":0.28982876095798843,"score_spread":0.25593222871193255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287548900","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09255161,0.000090161164,0.8687922,0.005555657,0.005693807,0.0059679057,0.0014312111,0.004296817,0.01562063],"genre_scores_gemma":[0.8726996,0.0007723124,0.11599557,0.00229426,0.00042494183,0.0035382463,0.0016291026,0.0001923904,0.0024535842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99577045,0.000060294118,0.0014422083,0.00091367617,0.00073049765,0.0010828946],"domain_scores_gemma":[0.99516404,0.00021783763,0.0008260442,0.0033433465,0.00023015735,0.00021856755],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013819373,0.000766497,0.0007439427,0.0008679178,0.0006186805,0.00062773813,0.004486035,0.0010051309,0.000018511788],"category_scores_gemma":[0.00006354341,0.0007633093,0.00048256852,0.0005402391,0.00017445421,0.0004662356,0.0062509887,0.0017386979,0.00059406116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021884785,0.0016948325,0.0012822277,0.0068368367,0.0017860393,0.00009200643,0.008231668,0.0015431566,0.000010670562,0.68773746,0.15321608,0.1373502],"study_design_scores_gemma":[0.003814982,0.00047182976,0.0043698256,0.0017930694,0.00019978892,0.00006364987,0.0010216704,0.47172776,0.001128094,0.10315478,0.40909085,0.003163703],"about_ca_topic_score_codex":0.000013654698,"about_ca_topic_score_gemma":0.000011726063,"teacher_disagreement_score":0.78014797,"about_ca_system_score_codex":0.00034250628,"about_ca_system_score_gemma":0.000083140636,"threshold_uncertainty_score":0.9994818},"labels":[],"label_agreement":null},{"id":"W4287553630","doi":"10.4230/lipics.cpm.2022.2","title":"String Attractors for Automatic Sequences","year":2020,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Attractor; String (physics); Combinatorics; Decidability; Sequence (biology); Mathematics; Prefix; Constant (computer programming); Upper and lower bounds; Discrete mathematics; Mathematical analysis; Mathematical physics; Computer science","score_opus":0.0406756292479632,"score_gpt":0.28597792565633673,"score_spread":0.24530229640837353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287553630","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10456338,0.00018472702,0.88077885,0.0015279306,0.004417151,0.003915092,0.0019502398,0.0016696517,0.0009929789],"genre_scores_gemma":[0.78431755,0.00006806555,0.21026151,0.002084419,0.0006533948,0.00096699724,0.0013733264,0.00013076926,0.0001439542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99490976,0.00006914088,0.002128575,0.0008430153,0.00081485877,0.0012346477],"domain_scores_gemma":[0.99534386,0.000625271,0.0014815327,0.001768119,0.00034575822,0.00043543626],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010918377,0.0009798971,0.0012282089,0.00040192314,0.00048401405,0.0018053624,0.0045265746,0.00068971596,0.000028033432],"category_scores_gemma":[0.00031749762,0.000899763,0.00088301057,0.00036203445,0.00016282545,0.0019390959,0.0027453955,0.0011124791,0.00011837683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002879899,0.0014940586,0.0057620257,0.04222587,0.0037453347,0.000086074884,0.085559405,0.0065738256,0.00068816607,0.54503226,0.043861084,0.26468393],"study_design_scores_gemma":[0.0023321798,0.00039562746,0.00059782085,0.0012791769,0.00014242365,0.00005675926,0.0011427165,0.89994144,0.0019798323,0.056422967,0.03385843,0.00185062],"about_ca_topic_score_codex":0.000024972182,"about_ca_topic_score_gemma":0.0000070385163,"teacher_disagreement_score":0.89336765,"about_ca_system_score_codex":0.0002893052,"about_ca_system_score_gemma":0.00042296373,"threshold_uncertainty_score":0.9993453},"labels":[],"label_agreement":null},{"id":"W4297416040","doi":"10.4230/lipics.cp.2022.6","title":"Acquiring Maps of Interrelated Conjectures on Sharp Bounds","year":2022,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science","score_opus":0.021980698048406112,"score_gpt":0.26933426744177313,"score_spread":0.24735356939336703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297416040","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7030138,0.0018165053,0.19821171,0.0027683272,0.031107664,0.00938647,0.008640209,0.003457208,0.041598096],"genre_scores_gemma":[0.9700009,0.00009399067,0.024165798,0.0022339812,0.00005688589,0.00036298358,0.0023527227,0.00011150358,0.00062120287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99503523,0.00010612272,0.0021735816,0.0007172943,0.0010722145,0.00089558575],"domain_scores_gemma":[0.99531627,0.00025391392,0.0015302452,0.0022237857,0.00042263535,0.00025316968],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011788696,0.00079535606,0.0010447816,0.00094368716,0.0004595909,0.00063920603,0.0034189252,0.00057071616,0.00011190439],"category_scores_gemma":[0.00015380539,0.00073420745,0.00071305304,0.00049796706,0.00021895593,0.0006170282,0.004785923,0.0018319641,0.000061830906],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012295014,0.0036584297,0.0055551403,0.012633716,0.004284323,0.00009391329,0.10130475,0.10041652,0.0006741235,0.6063758,0.12808631,0.035687484],"study_design_scores_gemma":[0.01395537,0.0038358134,0.0006834826,0.005891236,0.00045642158,0.00022803547,0.0029372585,0.52343184,0.009329578,0.19734104,0.23615874,0.005751202],"about_ca_topic_score_codex":0.00006073937,"about_ca_topic_score_gemma":0.0000070442916,"teacher_disagreement_score":0.4230153,"about_ca_system_score_codex":0.00021966423,"about_ca_system_score_gemma":0.00025159764,"threshold_uncertainty_score":0.9995109},"labels":[],"label_agreement":null},{"id":"W4302227484","doi":"10.4230/lipics.socg.2024.5","title":"Communication Complexity and Discrepancy of Halfplanes","year":2024,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Marianopolis College","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Upper and lower bounds; Mathematics; Hypercube; Omega; Factorization; Order (exchange); Norm (philosophy); Polynomial; Discrete mathematics; Physics; Mathematical analysis; Algorithm","score_opus":0.08719177781554249,"score_gpt":0.3545731149878742,"score_spread":0.2673813371723317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4302227484","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7896073,0.0009736543,0.1031702,0.0033232938,0.0014727457,0.0091939075,0.008392148,0.0010525358,0.082814194],"genre_scores_gemma":[0.5883448,0.00032447386,0.40427318,0.00027686887,0.00016590748,0.00064129254,0.004500901,0.00016026433,0.0013122795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99663115,0.00008142395,0.0021117243,0.0002940638,0.0005178142,0.0003638069],"domain_scores_gemma":[0.99665046,0.00051739527,0.0010876091,0.00118033,0.0004175127,0.0001467254],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009618064,0.0005399421,0.0009997766,0.00028439672,0.00017175534,0.00032399152,0.0006402883,0.0005176693,0.00013146097],"category_scores_gemma":[0.00051379565,0.00043546682,0.00034138004,0.0001425432,0.00037069552,0.0002968663,0.001366282,0.0010049292,0.00004747682],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005714128,0.00036007082,0.000091585665,0.019854622,0.0002562492,4.867712e-7,0.011100013,0.0000029414152,0.000011012331,0.9602669,0.0059631257,0.0020358586],"study_design_scores_gemma":[0.00069916603,0.00008577379,0.000056108653,0.002090696,0.00021789076,0.000023701401,0.0015970997,0.077606186,0.0004975179,0.9125449,0.0041315677,0.0004493938],"about_ca_topic_score_codex":0.000040046772,"about_ca_topic_score_gemma":0.00006909014,"teacher_disagreement_score":0.301103,"about_ca_system_score_codex":0.00009249854,"about_ca_system_score_gemma":0.00008468322,"threshold_uncertainty_score":0.9998097},"labels":[],"label_agreement":null},{"id":"W4310419450","doi":"10.4230/lipics.fscd.2022.20","title":"Decision Problems for Linear Logic with Least and Greatest Fixed Points","year":2022,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Prevention of Organ Failure","funders":"Agence Nationale de la Recherche","keywords":"Fixed point; Computer science; Mathematics; Mathematical optimization; Mathematical analysis","score_opus":0.04310459302682623,"score_gpt":0.3080269835349024,"score_spread":0.26492239050807614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4310419450","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021863049,0.00009866906,0.96867067,0.0003862436,0.001739224,0.00486545,0.0010508042,0.00037486662,0.0009510484],"genre_scores_gemma":[0.01940432,0.000095777694,0.97633773,0.0007238176,0.00014923955,0.0018218389,0.0011246109,0.000092837174,0.0002498513],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99567354,0.00010157145,0.0015932878,0.00085975765,0.0008632293,0.00090860034],"domain_scores_gemma":[0.99545556,0.0004135551,0.0013071874,0.0019377649,0.0006047445,0.0002811876],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00203985,0.0007885666,0.0008728864,0.0004990525,0.0006878665,0.0008350731,0.0025775067,0.00047491753,0.000024922796],"category_scores_gemma":[0.000381835,0.000664103,0.00028589723,0.00041000984,0.00020324308,0.0015816131,0.0031182421,0.0011111723,0.00002713542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0048291115,0.0035438626,0.025049273,0.032724038,0.0023467736,0.000051221683,0.074587286,0.049518578,0.00015559963,0.32227167,0.013244099,0.4716785],"study_design_scores_gemma":[0.0054296115,0.0019707729,0.0015164051,0.0010083844,0.00013699022,0.00021358958,0.00064276636,0.8674499,0.00045273383,0.020455288,0.09896392,0.0017596822],"about_ca_topic_score_codex":0.000019064119,"about_ca_topic_score_gemma":0.00001328235,"teacher_disagreement_score":0.8179313,"about_ca_system_score_codex":0.00030283415,"about_ca_system_score_gemma":0.00023417803,"threshold_uncertainty_score":0.99958104},"labels":[],"label_agreement":null},{"id":"W4385849427","doi":"10.4230/lipics.itcs.2023.73","title":"Recovery from Non-Decomposable Distance Oracles","year":2023,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Hamming distance; Sequence (biology); Combinatorics; Edit distance; Function (biology); Mathematics; Earth mover's distance; Dynamic time warping; Set (abstract data type); Alphabet; Estimator; Algorithm; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.02600066608497223,"score_gpt":0.27197818908609694,"score_spread":0.24597752300112471,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385849427","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012098577,0.00016527616,0.9661186,0.00045976622,0.007824482,0.0015284398,0.009267345,0.00087470113,0.0016628234],"genre_scores_gemma":[0.055822972,0.0013361605,0.9090617,0.002114317,0.001954788,0.0010767976,0.025051158,0.00037336242,0.0032087853],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99494714,0.00005895833,0.0018771372,0.0010160839,0.0009685143,0.0011321466],"domain_scores_gemma":[0.99425966,0.0004202415,0.0012293867,0.003347999,0.00037608107,0.00036665786],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00069750816,0.00090998923,0.0011024988,0.00038444222,0.0005352033,0.0020985433,0.0049352665,0.0007310193,0.000039581144],"category_scores_gemma":[0.00011304585,0.00083500746,0.00057314505,0.0003951422,0.000121171746,0.0028249242,0.007696982,0.0013441879,0.00088810024],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008438802,0.0023566927,0.008052834,0.007740676,0.0029387327,0.00023531687,0.025377741,0.02620607,0.00021496326,0.020067582,0.675168,0.23079751],"study_design_scores_gemma":[0.0019783524,0.00017369611,0.0013841095,0.0017136089,0.00007116664,0.000012951585,0.0003397621,0.7915834,0.0005143656,0.034435827,0.16613577,0.0016569969],"about_ca_topic_score_codex":0.00035030572,"about_ca_topic_score_gemma":0.000091351605,"teacher_disagreement_score":0.76537734,"about_ca_system_score_codex":0.00027905055,"about_ca_system_score_gemma":0.0003016147,"threshold_uncertainty_score":0.99988985},"labels":[],"label_agreement":null},{"id":"W4391922953","doi":"10.4230/lipics.esa.2018.22","title":"Improved Routing on the Delaunay Triangulation","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Geographic Information Systems Studies","field":"Social Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Delaunay triangulation; Computer science; Bowyer–Watson algorithm; Constrained Delaunay triangulation; Algorithm","score_opus":0.032457351564038076,"score_gpt":0.3050960411121619,"score_spread":0.2726386895481238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391922953","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.579224,0.000040782834,0.037659336,0.0070474516,0.0057881163,0.0069913506,0.00036799928,0.00078264205,0.3620983],"genre_scores_gemma":[0.9953225,0.000013925528,0.00058887934,0.0018173519,0.00079608225,0.00018465644,0.000066703025,0.00002285552,0.0011870005],"study_design_codex":"qualitative","study_design_gemma":"not_applicable","domain_scores_codex":[0.99710345,0.000105745785,0.0011288701,0.00016287483,0.0007097716,0.0007892813],"domain_scores_gemma":[0.99738795,0.00047014913,0.0007225626,0.00048449117,0.0008016389,0.00013321683],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0029649362,0.00027887142,0.00031301775,0.0002304236,0.0030313097,0.00046224284,0.0006166695,0.00022428652,0.00011739283],"category_scores_gemma":[0.0008762316,0.00019873644,0.00024809342,0.00057279534,0.0005548958,0.0010772224,0.00013728347,0.00027724885,0.0003973335],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032172125,0.00018725442,0.014097245,0.0001936377,0.00048492142,6.6924895e-7,0.51582205,0.000032824908,0.000052411197,0.42747,0.021812396,0.01952486],"study_design_scores_gemma":[0.004481672,0.0006903959,0.0053960336,0.0003258877,0.00010152406,0.00000890728,0.15883206,0.020760931,0.0006667801,0.004288971,0.80334646,0.0011003979],"about_ca_topic_score_codex":0.00028923963,"about_ca_topic_score_gemma":0.0005501776,"teacher_disagreement_score":0.7815341,"about_ca_system_score_codex":0.0001724576,"about_ca_system_score_gemma":0.00009884306,"threshold_uncertainty_score":0.99826664},"labels":[],"label_agreement":null},{"id":"W4394636026","doi":"10.4230/lipics.approx/random.2022.21","title":"Learning Generalized Depth Three Arithmetic Circuits in the Non-Degenerate Case","year":2022,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Science and Engineering Research Board; Natural Sciences and Engineering Research Council of Canada; Department of Science and Technology, Ministry of Science and Technology, India","keywords":"Rank (graph theory); Undecidable problem; Tensor (intrinsic definition); Mathematics; Domain (mathematical analysis); Computational complexity theory; Conjecture; Polynomial; Time complexity; Matrix (chemical analysis); Symmetric tensor; Algebra over a field; Discrete mathematics; Combinatorics; Pure mathematics; Algorithm; Decidability; Exact solutions in general relativity; Mathematical analysis","score_opus":0.06372568142230997,"score_gpt":0.33636613014081457,"score_spread":0.27264044871850457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394636026","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92995626,0.000081855345,0.051929135,0.0008295447,0.0009192025,0.0055643125,0.0016529097,0.00034420844,0.008722604],"genre_scores_gemma":[0.96396995,0.00007854989,0.025093406,0.0014346454,0.00035340205,0.004269817,0.0039630723,0.00019173157,0.0006454318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954866,0.00024377731,0.0020692847,0.00053324667,0.000780457,0.00088661764],"domain_scores_gemma":[0.99621123,0.0005971823,0.0011720966,0.0015726436,0.00026419573,0.00018265635],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0017029009,0.0007738151,0.0009605998,0.00050169136,0.00097530254,0.0006472476,0.0014831914,0.00046169764,0.00031925112],"category_scores_gemma":[0.0001946312,0.0006532728,0.0006046845,0.00049952796,0.00012872362,0.0002958583,0.0010741549,0.0027309558,0.0001292103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006644884,0.011149507,0.029732909,0.0218697,0.0042651547,0.0031802468,0.2952945,0.066810116,0.00063900265,0.38891098,0.11471465,0.06276876],"study_design_scores_gemma":[0.021138145,0.0009797594,0.002845833,0.0012929289,0.0017099049,0.008630726,0.035474382,0.5200708,0.00071670284,0.21067746,0.18977721,0.0066861706],"about_ca_topic_score_codex":0.00011923673,"about_ca_topic_score_gemma":0.00048497762,"teacher_disagreement_score":0.45326066,"about_ca_system_score_codex":0.0003322711,"about_ca_system_score_gemma":0.00017297859,"threshold_uncertainty_score":0.9995918},"labels":[],"label_agreement":null},{"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.014938161947430808,"score_gpt":0.2756569372533093,"score_spread":0.2607187753058785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394666350","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9607647,0.00049468596,0.03197103,0.00018921366,0.00014707,0.0020750763,0.0006360673,0.00017849033,0.0035436377],"genre_scores_gemma":[0.9508595,0.0016350644,0.035309672,0.0010655313,0.0003052196,0.0006394113,0.00879171,0.00013422687,0.0012596853],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99675244,0.00006966739,0.0011778837,0.00075332087,0.00047036758,0.0007763034],"domain_scores_gemma":[0.99663955,0.00004409293,0.0010129306,0.0013573194,0.00068279624,0.00026333434],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062813616,0.0008191685,0.0008769992,0.00023879576,0.00024400196,0.000657179,0.00091906934,0.00084358413,0.00001880721],"category_scores_gemma":[0.000108524175,0.00070031156,0.00030806343,0.0001419441,0.00042311847,0.00009611139,0.001328276,0.00069901656,0.000022029073],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013166484,0.0011347355,0.059360657,0.012036241,0.00833338,0.00014161495,0.0097485725,0.00048986706,0.7770384,0.0016036463,0.08493759,0.04385866],"study_design_scores_gemma":[0.0055025155,0.002592547,0.0014766337,0.0030894547,0.0014257819,0.00070466194,0.0034775638,0.016177693,0.78014904,0.0014740116,0.17820214,0.005727984],"about_ca_topic_score_codex":0.0002294984,"about_ca_topic_score_gemma":0.00010823367,"teacher_disagreement_score":0.09326455,"about_ca_system_score_codex":0.00008493591,"about_ca_system_score_gemma":0.0002201457,"threshold_uncertainty_score":0.9995448},"labels":[],"label_agreement":null},{"id":"W4394667522","doi":"10.4230/lipics.fun.2022.3","title":"Pushing Blocks via Checkable Gadgets: PSPACE-Completeness of Push-1F and Block/Box Dude","year":2022,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Hand Gesture Recognition Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science","score_opus":0.02073116981896781,"score_gpt":0.25911460801713004,"score_spread":0.23838343819816224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394667522","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25953254,0.0014431813,0.69863003,0.0017364046,0.010151464,0.007772011,0.0038077272,0.0011305963,0.015796015],"genre_scores_gemma":[0.9407107,0.00027438084,0.05412048,0.0009557733,0.0005092266,0.0011887774,0.0012066967,0.00016823503,0.0008656745],"study_design_codex":"qualitative","study_design_gemma":"not_applicable","domain_scores_codex":[0.9936506,0.00018979798,0.0026828423,0.00092136825,0.0013624724,0.0011929035],"domain_scores_gemma":[0.9941997,0.00038456032,0.002136065,0.00212837,0.0007226651,0.000428648],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020283796,0.0010010834,0.0017093302,0.0008270226,0.00062078243,0.0009984428,0.0030521948,0.00067513937,0.00007670758],"category_scores_gemma":[0.00016631276,0.0009783121,0.00058802794,0.0005969927,0.00020785163,0.0013136936,0.0055160397,0.0016437758,0.000038909377],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016702147,0.008728667,0.09751151,0.11069492,0.014388107,0.0004690561,0.41594538,0.030165344,0.005227122,0.03332363,0.07343268,0.20844337],"study_design_scores_gemma":[0.01457565,0.0014193564,0.003282266,0.0051766173,0.00069805165,0.001780076,0.008378973,0.32038173,0.010594441,0.01129847,0.6151669,0.0072474545],"about_ca_topic_score_codex":0.00017597167,"about_ca_topic_score_gemma":0.00005308537,"teacher_disagreement_score":0.6811782,"about_ca_system_score_codex":0.00028626632,"about_ca_system_score_gemma":0.00031586387,"threshold_uncertainty_score":0.99926674},"labels":[],"label_agreement":null},{"id":"W4405765923","doi":"10.4230/lipics.esa.2022.56","title":"Improved Polynomial-Time Approximations for Clustering with Minimum Sum of Radii or Diameters","year":2022,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Clustering Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Cluster analysis; Algorithm; Mathematics; Combinatorics; Computer science; Statistics","score_opus":0.026285380078038455,"score_gpt":0.2950712382600269,"score_spread":0.26878585818198847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405765923","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009968891,0.00003944248,0.9780298,0.00041468075,0.0012511669,0.006051362,0.0034130192,0.00035967064,0.00047197056],"genre_scores_gemma":[0.025734626,0.00004354654,0.96502584,0.00029429712,0.00024619862,0.0041940436,0.0015216849,0.00022783794,0.0027119508],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945722,0.000093996845,0.0020365487,0.0008784428,0.0010002506,0.0014185121],"domain_scores_gemma":[0.99420106,0.000795919,0.0015670988,0.002457453,0.000623672,0.0003547681],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011382449,0.0008763144,0.0013232898,0.0008774255,0.0005857344,0.00066203246,0.0041060303,0.00039944847,0.000053227577],"category_scores_gemma":[0.00030844632,0.0007595661,0.0005493798,0.0006297855,0.0002829505,0.001480557,0.005703037,0.001171825,0.000010205649],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.016183557,0.0062713204,0.00084009906,0.09050906,0.009942262,0.000110591754,0.1430764,0.359467,0.0066401013,0.0030140264,0.02235442,0.34159115],"study_design_scores_gemma":[0.004350034,0.0012280716,0.00002206096,0.00035656392,0.000069536036,0.00005907971,0.0008700626,0.9772381,0.0012507556,0.0001924291,0.013387298,0.00097599666],"about_ca_topic_score_codex":0.000044899,"about_ca_topic_score_gemma":0.000026268708,"teacher_disagreement_score":0.6177711,"about_ca_system_score_codex":0.0006388776,"about_ca_system_score_gemma":0.0007585934,"threshold_uncertainty_score":0.99948555},"labels":[],"label_agreement":null},{"id":"W4406206083","doi":"10.4230/lipics.icdt.2024.15","title":"Conjunctive Queries on Probabilistic Graphs: The Limits of Approximability","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Simons Institute for the Theory of Computing, University of California Berkeley; Ministry of Education, India; Agence Nationale de la Recherche; National Research Foundation; Deutsche Forschungsgemeinschaft; National Research Foundation Singapore","keywords":"Probabilistic logic; Computer science; Conjunctive query; Theoretical computer science; Artificial intelligence; Information retrieval; Relational database","score_opus":0.02464285751339443,"score_gpt":0.2679624310476123,"score_spread":0.24331957353421788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406206083","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10186404,0.0004451875,0.83639085,0.0050290795,0.006795802,0.0076019606,0.0022074108,0.0014180559,0.03824761],"genre_scores_gemma":[0.9810436,0.00005749109,0.016551437,0.00096803764,0.00012724817,0.00037554943,0.0002941792,0.00003875624,0.00054373953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977334,0.000054339784,0.0008233701,0.00036074853,0.0005463739,0.00048176156],"domain_scores_gemma":[0.9978569,0.00043374277,0.00022231198,0.0011941909,0.00020589195,0.00008693427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009811937,0.0003269615,0.00034557647,0.00022650042,0.00023510902,0.00071562646,0.0016705443,0.00009333023,0.000012865649],"category_scores_gemma":[0.00018552515,0.00021075274,0.00025604034,0.000647259,0.00035020843,0.0020712938,0.0005023173,0.0003355744,0.000084649044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007029455,0.000334662,0.00031660896,0.0016357212,0.00026192283,0.000004331524,0.008394965,0.0001002102,0.000009761136,0.9173837,0.00807838,0.06340949],"study_design_scores_gemma":[0.002570703,0.0018474851,0.0022233033,0.0009441671,0.0001901325,0.000034812114,0.003292918,0.57430816,0.0019645717,0.12771134,0.2835874,0.0013249941],"about_ca_topic_score_codex":0.000011183604,"about_ca_topic_score_gemma":0.000007986419,"teacher_disagreement_score":0.87917954,"about_ca_system_score_codex":0.00007205011,"about_ca_system_score_gemma":0.00007714945,"threshold_uncertainty_score":0.85942477},"labels":[],"label_agreement":null},{"id":"W4412212567","doi":"10.4230/dagrep.14.5.58","title":"Evaluation Perspectives of Recommender Systems: Driving Research and Education (Dagstuhl Seminar 24211)","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Joint Research Centre; Universität Innsbruck; Universität Duisburg-Essen; Universiteit Antwerpen; Universidade Federal de Minas Gerais; Göteborgs Universitet; Technische Universität Wien; Technische Universiteit Delft; Science Foundation Ireland; York University; Vrije Universiteit Brussel; Universität Siegen; University College Dublin; TU Graz, Internationale Beziehungen und Mobilitätsprogramme; Drexel University; University of Pittsburgh; University of Minnesota; National Science Foundation","keywords":"Computer science","score_opus":0.06446594382043357,"score_gpt":0.3821489684670414,"score_spread":0.3176830246466078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412212567","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24385726,0.014191799,0.67613244,0.004433232,0.0074622156,0.009825056,0.00022299006,0.0013709047,0.042504076],"genre_scores_gemma":[0.9834943,0.00034305605,0.0147536015,0.000055782242,0.00021462805,0.0005847126,0.00006141531,0.000037765363,0.0004547475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965555,0.00026477294,0.0010718644,0.00045044906,0.0011118192,0.00054560933],"domain_scores_gemma":[0.9968723,0.00040281532,0.00024848542,0.0008198909,0.0015030913,0.000153407],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00609069,0.00029755762,0.00041328275,0.0008652196,0.00033408485,0.0010953598,0.0008137601,0.00021556746,0.0000112737325],"category_scores_gemma":[0.000192389,0.00026198564,0.00012881945,0.0006877488,0.00013018526,0.002422821,0.00047051246,0.00046594263,0.000019200585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003683268,0.0010772684,0.0031153222,0.006337819,0.00073602656,0.0000034465625,0.14532001,0.000054674685,0.0005359462,0.38126686,0.1128271,0.3486887],"study_design_scores_gemma":[0.0015774812,0.0014534368,0.0010468834,0.005077507,0.0001358246,0.0002948169,0.074435376,0.7005381,0.002640592,0.026215948,0.18539403,0.0011900311],"about_ca_topic_score_codex":0.00011024618,"about_ca_topic_score_gemma":0.000016988995,"teacher_disagreement_score":0.739637,"about_ca_system_score_codex":0.0004576738,"about_ca_system_score_gemma":0.0004331845,"threshold_uncertainty_score":0.99998325},"labels":[],"label_agreement":null},{"id":"W4412224928","doi":"10.4230/lipics.itcs.2024.20","title":"Discreteness of Asymptotic Tensor Ranks (Extended Abstract)","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Elasticity and Wave Propagation","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Novo Nordisk Fonden; Université de Genève; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Novo Nordisk; National Centres of Competence in Research SwissMAP; Centre de Recherches Mathématiques; Erasmus+; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; Villum Fonden; National Science Foundation","keywords":"Tensor (intrinsic definition); Mathematics; Geology; Pure mathematics","score_opus":0.008627982498156384,"score_gpt":0.2272095582785489,"score_spread":0.21858157578039253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412224928","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81076044,0.0005072886,0.1653747,0.00015901295,0.0032648195,0.001527864,0.0014358568,0.0011735376,0.015796486],"genre_scores_gemma":[0.99668074,0.000074450116,0.0023645046,0.000055023513,0.00015241973,0.00006388431,0.00036431543,0.00007197978,0.00017269311],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980043,0.000010060229,0.0009960107,0.00015790548,0.00034679958,0.00048493367],"domain_scores_gemma":[0.9991102,0.00018750815,0.00010527092,0.00032974157,0.0001442039,0.0001230757],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031742099,0.00032547401,0.0003906166,0.000269858,0.00009820988,0.00019072437,0.00030759798,0.00022734085,0.000093924464],"category_scores_gemma":[0.000070006616,0.0002867179,0.00023731527,0.00026214402,0.00009817847,0.00095890375,0.00006444935,0.00040901723,0.0001772611],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014860744,0.0019712604,0.011125943,0.14317441,0.007857034,0.00016373077,0.07960138,0.19483986,0.055053737,0.13416603,0.03078697,0.3397736],"study_design_scores_gemma":[0.0029304018,0.00036110228,0.006678618,0.0019650634,0.00032615717,0.00010139058,0.0013330806,0.893048,0.058928706,0.0037187843,0.029305073,0.0013036348],"about_ca_topic_score_codex":0.0000055229825,"about_ca_topic_score_gemma":0.000007418843,"teacher_disagreement_score":0.69820815,"about_ca_system_score_codex":0.00009724493,"about_ca_system_score_gemma":0.000038621,"threshold_uncertainty_score":0.9999585},"labels":[],"label_agreement":null},{"id":"W44525949","doi":"10.4230/dagsemproc.07351.7","title":"Belief Change and Cryptographic Protocol Verification","year":2007,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Protocol (science); Cryptographic protocol; Computer science; Cryptographic primitive; Context (archaeology); Theoretical computer science; Cryptography; Model checking; Computer security; Medicine","score_opus":0.03827127503498007,"score_gpt":0.31928922582668573,"score_spread":0.28101795079170566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W44525949","genre_codex":"methods","genre_gemma":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034944492,0.0000082836805,0.8597879,0.00029308914,0.00019590746,0.13478641,0.000045414494,0.00032624824,0.0010623009],"genre_scores_gemma":[0.35475984,0.000010481523,0.22381666,0.002099106,0.00026868045,0.41876268,0.00012530548,0.000066734,0.00009051659],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99741405,0.000029609442,0.0010114508,0.0003722783,0.000476987,0.00069560646],"domain_scores_gemma":[0.9977605,0.00011160077,0.00055834185,0.0009785127,0.00033158966,0.00025950896],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010666066,0.00033134507,0.00028670378,0.00036153838,0.0003881874,0.00034570176,0.0009847744,0.00019403892,0.000012121682],"category_scores_gemma":[0.000085179105,0.00031268678,0.00011909673,0.0005821773,0.00016374118,0.0029333397,0.0003832092,0.0003095216,0.00006322783],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022571113,0.00089162745,0.011848914,0.0016956995,0.00009283247,0.0000050990584,0.025303638,0.000006062343,0.00047053184,0.76179993,0.00032853443,0.19733143],"study_design_scores_gemma":[0.015514478,0.0016292052,0.063102625,0.0006397966,0.00005666392,0.00020196105,0.0014654484,0.0946105,0.014497136,0.12989765,0.6755791,0.0028054728],"about_ca_topic_score_codex":0.0000058605665,"about_ca_topic_score_gemma":0.0000110709025,"teacher_disagreement_score":0.67525053,"about_ca_system_score_codex":0.00007856209,"about_ca_system_score_gemma":0.000039130842,"threshold_uncertainty_score":0.9999325},"labels":[],"label_agreement":null},{"id":"W6891491675","doi":"10.4230/lipics.disc.2022.30","title":"The Space Complexity of Scannable Objects with Bounded Components","year":2022,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Bounded function; Object (grammar); Component (thermodynamics); Domain (mathematical analysis); Asynchronous communication; Construct (python library); Sequence (biology); Binary number","score_opus":0.022658546970267722,"score_gpt":0.23157766563717694,"score_spread":0.2089191186669092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891491675","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46081805,0.00038456736,0.4981441,0.003263144,0.0045266603,0.0048719677,0.0033735586,0.00057334616,0.02404462],"genre_scores_gemma":[0.9903376,0.000007091055,0.0082776295,0.00032975318,0.00003917957,0.00020530823,0.00021958695,0.000022210292,0.00056163967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970969,0.00008896039,0.0008851078,0.00025897886,0.00094199675,0.00072805764],"domain_scores_gemma":[0.99758184,0.00012005927,0.00071977306,0.0011130557,0.0003135791,0.0001516963],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00086518505,0.00029703908,0.00044833627,0.00010786849,0.0015348129,0.0004490979,0.002104456,0.000057446745,0.000012867763],"category_scores_gemma":[0.000027582862,0.00021407825,0.0001689682,0.00060246774,0.0003215776,0.0008812634,0.00083839707,0.0003781254,0.00001807987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012478007,0.002051335,0.01273216,0.0016990666,0.0010485013,0.000037923684,0.035721574,0.006001638,0.00054962357,0.8715564,0.059066933,0.008287059],"study_design_scores_gemma":[0.0070402706,0.0012242962,0.004990599,0.00020738697,0.000040911113,0.00027541773,0.0062465253,0.32101724,0.0012427093,0.0048626605,0.6518389,0.0010130976],"about_ca_topic_score_codex":0.00013582436,"about_ca_topic_score_gemma":0.00006520351,"teacher_disagreement_score":0.86669374,"about_ca_system_score_codex":0.00017262161,"about_ca_system_score_gemma":0.00015916194,"threshold_uncertainty_score":0.99976504},"labels":[],"label_agreement":null},{"id":"W6891507486","doi":"10.4230/lipics.cp.2024.32","title":"Solving LBBD Master Problems with Constraint Programming and Domain-Independent Dynamic Programming","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Assembly Line Balancing Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Constraint programming; Dynamic programming; Constraint (computer-aided design); Exploit; Integer programming; Set (abstract data type); State (computer science); Construct (python library); Variable (mathematics); Dimension (graph theory)","score_opus":0.006743633718957348,"score_gpt":0.21102507861418743,"score_spread":0.2042814448952301,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891507486","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23046531,0.00047357872,0.7613409,0.00014464832,0.0007643322,0.003239458,0.00013713946,0.0018119483,0.0016226977],"genre_scores_gemma":[0.86487883,0.00004289049,0.13395487,0.000047178328,0.000093640825,0.00036999327,0.00035928187,0.00015929175,0.00009401466],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99743867,0.000015495643,0.0009060461,0.00031731182,0.00042669673,0.00089577114],"domain_scores_gemma":[0.9990945,0.00008116739,0.00013611773,0.00034404008,0.0001391024,0.0002051148],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046857755,0.00052385766,0.00043124234,0.0003178334,0.00022362391,0.0010269495,0.00023962332,0.00022790497,0.000011748283],"category_scores_gemma":[0.000017878465,0.0004485768,0.00011586429,0.0003245874,0.00013322376,0.0012162812,0.00012448052,0.0005345017,0.000027976437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028069876,0.00058143446,0.027397523,0.04417381,0.0032210867,0.00022005726,0.10316099,0.14955278,0.0015971496,0.009078521,0.0010475968,0.65968835],"study_design_scores_gemma":[0.0021624276,0.00036037073,0.0003503714,0.0020550927,0.00014333834,0.0005176335,0.0049066828,0.9421352,0.00021547031,0.00015497667,0.045938876,0.0010595709],"about_ca_topic_score_codex":0.000005550926,"about_ca_topic_score_gemma":0.00006149999,"teacher_disagreement_score":0.7925824,"about_ca_system_score_codex":0.00026283693,"about_ca_system_score_gemma":0.0000676939,"threshold_uncertainty_score":0.99979657},"labels":[],"label_agreement":null},{"id":"W6891547493","doi":"10.4230/lipics.itcs.2025.37","title":"A Lower Bound on the Trace Norm of Boolean Matrices and Its Applications","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of Toronto; McGill University","funders":"University of Toronto; Natural Sciences and Engineering Research Council of Canada; University of Rochester","keywords":"Boolean function; Logarithm; Parity function; Binary decision diagram; Exponential function; Norm (philosophy); Upper and lower bounds; Integer (computer science); Binary number","score_opus":0.015653053134792778,"score_gpt":0.26034667450172133,"score_spread":0.24469362136692854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891547493","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21658097,0.0010611891,0.7352095,0.0066305455,0.001314631,0.0043095886,0.00064927404,0.000367905,0.033876378],"genre_scores_gemma":[0.9834276,0.00018477354,0.013219256,0.001960818,0.00007704123,0.000327227,0.000029879111,0.000017257882,0.0007561344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984871,0.000023378701,0.0006326229,0.00021264567,0.00029963956,0.00034457823],"domain_scores_gemma":[0.9983004,0.00045254716,0.00026641096,0.00071901554,0.00018702805,0.00007462749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043954104,0.00022139905,0.00025900232,0.0002449806,0.00046746837,0.00032807444,0.001268813,0.00009373287,0.000010714938],"category_scores_gemma":[0.000055368993,0.00016410524,0.00014827838,0.0006204765,0.00014719811,0.000666658,0.00041604572,0.00026415393,0.00002551291],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004304828,0.00036738726,0.0002872482,0.0005270564,0.00013359942,8.5403735e-7,0.0032605059,0.00004301908,0.00004086843,0.95180666,0.0033765943,0.040113132],"study_design_scores_gemma":[0.0033278624,0.0006882442,0.0024522294,0.00067052216,0.0001135855,0.000043469616,0.0020028993,0.30797875,0.00512788,0.07159177,0.60500896,0.0009938383],"about_ca_topic_score_codex":0.000006920707,"about_ca_topic_score_gemma":0.000010685073,"teacher_disagreement_score":0.8802149,"about_ca_system_score_codex":0.00003395344,"about_ca_system_score_gemma":0.000062093575,"threshold_uncertainty_score":0.6692018},"labels":[],"label_agreement":null},{"id":"W6891549005","doi":"10.4230/lipics.ecrts.2025.2","title":"Multi-Objective Memory Bandwidth Regulation and Cache Partitioning for Multicore Real-Time Systems","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Bundesministerium für Bildung und Forschung","keywords":"Cache; Scheduling (production processes); Knapsack problem; Heuristic; Bandwidth (computing); Benchmarking; Multi-core processor; Memory bandwidth; Task (project management); Linear programming","score_opus":0.014450534183901556,"score_gpt":0.26341798192404414,"score_spread":0.2489674477401426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891549005","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09670356,0.00014842414,0.89398426,0.0002004572,0.0014709482,0.0041236226,0.00019100003,0.00047276655,0.0027049403],"genre_scores_gemma":[0.8097537,0.000028316656,0.18634805,0.00019845323,0.00019714155,0.0009419521,0.00034561876,0.000057937355,0.0021288448],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99681175,0.000107448475,0.0014046697,0.00052060076,0.00039342354,0.00076209387],"domain_scores_gemma":[0.99707305,0.00055915344,0.0006599416,0.0008870852,0.0006243229,0.0001964562],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001382658,0.0004532544,0.00066910876,0.0004285623,0.00069598976,0.001019494,0.00072939484,0.0003077292,0.0000038167473],"category_scores_gemma":[0.0003038628,0.00042759767,0.00021523447,0.00042933144,0.00011400381,0.0025190318,0.00035185998,0.0002497002,0.000040530555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025289615,0.003965872,0.069555394,0.04545721,0.0073462464,0.00005343337,0.27020022,0.119363435,0.06157406,0.23887144,0.040237065,0.14084665],"study_design_scores_gemma":[0.003971208,0.00014055899,0.0035815632,0.00070975645,0.00006764646,0.000036372665,0.0016843425,0.9846821,0.002065244,0.0003785567,0.0021897263,0.0004929318],"about_ca_topic_score_codex":0.00014054061,"about_ca_topic_score_gemma":0.00002220777,"teacher_disagreement_score":0.86531866,"about_ca_system_score_codex":0.0002892708,"about_ca_system_score_gemma":0.00016415188,"threshold_uncertainty_score":0.9998176},"labels":[],"label_agreement":null},{"id":"W6891556177","doi":"10.4230/lipics.aofa.2018.1","title":"OMG: GW, CLT, CRT and CFTP (Flajolet Award Lecture)","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Commutative Algebra and Its Applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Work (physics); Mistake; Troubleshooting","score_opus":0.03266786689363419,"score_gpt":0.3306004135705848,"score_spread":0.29793254667695057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891556177","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78380406,0.0001206418,0.1874029,0.0020120393,0.00070107146,0.0026342783,0.00080108305,0.00050201884,0.022021895],"genre_scores_gemma":[0.96384984,0.00005731777,0.03230449,0.0018486064,0.00051027286,0.00027151278,0.00025704465,0.00011070167,0.000790187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99742895,0.00004722573,0.001079351,0.00030746902,0.0004056171,0.00073136366],"domain_scores_gemma":[0.99742085,0.00046820767,0.0004458248,0.0009278535,0.00047085882,0.0002663819],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005450716,0.00047836575,0.00056822185,0.00022788513,0.00066452613,0.00028724706,0.000597666,0.0002519525,0.00018864288],"category_scores_gemma":[0.0003137052,0.0004112942,0.00020846305,0.00033014774,0.000437062,0.00068233814,0.00038167907,0.0004247699,0.00032457543],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005732401,0.0016468536,0.014640601,0.0027526554,0.0013790597,0.0000079488245,0.0714524,0.000010019266,0.0010064947,0.59362054,0.25879893,0.054111235],"study_design_scores_gemma":[0.006360137,0.0011806864,0.0038293758,0.0003451329,0.00037132818,0.00019915115,0.0033803834,0.01029859,0.007872312,0.22496602,0.7394267,0.001770185],"about_ca_topic_score_codex":0.000014565183,"about_ca_topic_score_gemma":0.00008629069,"teacher_disagreement_score":0.48062778,"about_ca_system_score_codex":0.000098347686,"about_ca_system_score_gemma":0.000074346346,"threshold_uncertainty_score":0.9998339},"labels":[],"label_agreement":null},{"id":"W6891559455","doi":"10.4230/lipics.disc.2022.40","title":"Brief Announcement: Distributed Algorithms for Minimum Dominating Set Problem and Beyond, a New Approach","year":2022,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Dominating set; Set cover problem; Set (abstract data type); Connected dominating set; Cover (algebra); Distributed algorithm","score_opus":0.030134733620477132,"score_gpt":0.2921644039674968,"score_spread":0.2620296703470197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891559455","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047174003,0.00009213748,0.9849509,0.0006150569,0.00030059804,0.0034953717,0.0036536,0.00021715323,0.0019578054],"genre_scores_gemma":[0.09386569,0.000031280088,0.89316374,0.0017256375,0.00024185007,0.003267021,0.005681429,0.00012315616,0.001900177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960836,0.00010008712,0.0010673074,0.00061259134,0.0009063081,0.0012300642],"domain_scores_gemma":[0.9974984,0.00038815173,0.000511346,0.00091382733,0.00030996997,0.00037828722],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0018453225,0.00044807993,0.00052489736,0.00036467024,0.0013535586,0.00062819646,0.0018946719,0.00011401228,0.000020393823],"category_scores_gemma":[0.00015324821,0.00044596838,0.00022602227,0.0008744762,0.00017530263,0.0019365741,0.0019961426,0.0005730411,0.000008466834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016007504,0.0020202445,0.0021409267,0.003832725,0.0010382143,0.00002855827,0.07772658,0.006104793,0.00048640106,0.53327596,0.07689475,0.2948501],"study_design_scores_gemma":[0.009487802,0.0010759027,0.000042867632,0.000049000293,0.000042773547,0.0002121933,0.005785281,0.7264531,0.0002911424,0.045459654,0.21012886,0.0009713689],"about_ca_topic_score_codex":0.000011445935,"about_ca_topic_score_gemma":0.0000022724396,"teacher_disagreement_score":0.72034836,"about_ca_system_score_codex":0.00025924869,"about_ca_system_score_gemma":0.00021263956,"threshold_uncertainty_score":0.99994653},"labels":[],"label_agreement":null},{"id":"W6891564556","doi":"10.4230/lipics.cp.2025.30","title":"Exact Methods for the Travelling Salesperson Problem with Self-Deleting Graphs","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Alliance de recherche numérique du Canada; University of Toronto; Innovation, Science and Economic Development Canada","keywords":"Vertex (graph theory); Solver; Preprocessor; Integer programming; Linear programming; Constraint programming; Dependency graph; Simple (philosophy)","score_opus":0.012088851120582863,"score_gpt":0.29377524430412555,"score_spread":0.28168639318354266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891564556","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006560007,0.00022842169,0.9848082,0.0002085972,0.0005454114,0.002447662,0.000087026776,0.00087049184,0.004244186],"genre_scores_gemma":[0.04360841,0.00011392688,0.9549117,0.00035601345,0.00008343018,0.00050855556,0.00010761614,0.00012115027,0.00018916444],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99755675,0.00009116819,0.0010512199,0.0002482076,0.0002406271,0.0008120306],"domain_scores_gemma":[0.99737054,0.0014117582,0.00025041707,0.00056679355,0.0002900657,0.000110447916],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002340471,0.0004765354,0.00050745264,0.00031751266,0.00058253476,0.0003525221,0.0006061552,0.000236286,0.000011022671],"category_scores_gemma":[0.00015326383,0.00035521595,0.0002660684,0.00068199344,0.00008128748,0.0005080663,0.00007847238,0.000505538,0.0000064567203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040923184,0.00025729658,0.0037788434,0.00838538,0.0027792281,0.0000018546573,0.033582572,0.68575907,0.00077765324,0.01800609,0.0038165124,0.24244629],"study_design_scores_gemma":[0.0022434294,0.00010237013,0.0001093012,0.00031506742,0.00022303466,0.000015173188,0.0021016106,0.9435756,0.0030730597,0.00044209213,0.047329787,0.00046946638],"about_ca_topic_score_codex":0.000005491233,"about_ca_topic_score_gemma":0.0000051425673,"teacher_disagreement_score":0.25781655,"about_ca_system_score_codex":0.00016788524,"about_ca_system_score_gemma":0.000071350805,"threshold_uncertainty_score":0.99988997},"labels":[],"label_agreement":null},{"id":"W6891570807","doi":"10.4230/oasics.manzini.0","title":"Front Matter, Table of Contents, Preface, Conference Organization","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Diverse Scientific and Economic Studies","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Table (database); Front (military); Table of contents; Front office; Front and back ends","score_opus":0.02358150356367914,"score_gpt":0.20934650921269696,"score_spread":0.18576500564901782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891570807","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12796347,0.00059976947,0.050850704,0.0005265355,0.0063622613,0.0017599084,0.009234457,0.00012318468,0.8025797],"genre_scores_gemma":[0.8216227,0.00020157889,0.0021334016,0.0008867377,0.000040248407,0.000060961396,0.00046678152,0.00003067046,0.17455687],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99797803,0.0000058306373,0.0012942086,0.00027004504,0.000053624008,0.00039823493],"domain_scores_gemma":[0.9985236,0.00004020781,0.0006711831,0.000440893,0.00025798552,0.00006611052],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00037401222,0.00022109228,0.00060801936,0.00030800336,0.00020428344,0.00018038535,0.00046963492,0.00013115538,0.0049838126],"category_scores_gemma":[0.00012265833,0.00023885808,0.00011954679,0.0002676833,0.00015029672,0.0007389924,0.00026092588,0.00012067951,0.0064299502],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069333364,0.00034135257,0.23037113,0.0008393615,0.0005449013,3.8972726e-7,0.0053862846,0.000121189165,0.000030500889,0.16389242,0.59793705,0.00046608408],"study_design_scores_gemma":[0.005038323,0.00010289604,0.018453043,0.00026081403,0.00006377734,0.0000033340887,0.0058119087,0.0083378805,0.0013565553,0.0058465097,0.9539783,0.0007466624],"about_ca_topic_score_codex":0.000086005544,"about_ca_topic_score_gemma":0.000010216755,"teacher_disagreement_score":0.6936593,"about_ca_system_score_codex":0.0001215861,"about_ca_system_score_gemma":0.000035972862,"threshold_uncertainty_score":0.9959258},"labels":[],"label_agreement":null},{"id":"W6891584202","doi":"10.4230/lipics.disc.2024.7","title":"A Fully Concurrent Adaptive Snapshot Object for RMWable Shared-Memory","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Snapshot (computer storage); Concurrency; Linearizability; Concurrent computing; Constant (computer programming)","score_opus":0.021010650707451794,"score_gpt":0.27211145065385633,"score_spread":0.25110079994640455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891584202","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037230118,0.0009925071,0.97139066,0.00052088767,0.005498759,0.0028881321,0.005478515,0.0006212277,0.008886306],"genre_scores_gemma":[0.9619626,0.00004983015,0.02985241,0.0012330288,0.0007355024,0.0016594637,0.0024958423,0.000100467696,0.0019108689],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99630743,0.000035784306,0.001337673,0.0005954559,0.00060287415,0.0011207537],"domain_scores_gemma":[0.9977278,0.00028424314,0.00032187896,0.0008967165,0.0004629416,0.00030643784],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008279353,0.00055634684,0.00065539894,0.00028364197,0.00045109438,0.0016424016,0.0016031519,0.00025400033,0.00005614426],"category_scores_gemma":[0.000082726576,0.00048589896,0.0005404887,0.00058592495,0.00010441422,0.002838416,0.00040400846,0.0004213138,0.00023303498],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028359436,0.00075928145,0.00022441163,0.0068284306,0.0011487224,0.000067521425,0.031301826,0.0013162433,0.00022838615,0.2986713,0.50561374,0.15355654],"study_design_scores_gemma":[0.0019634461,0.0004899716,0.000051864965,0.0006787541,0.000041288873,0.00008628629,0.0008138276,0.52257997,0.00052448345,0.0009699955,0.47113135,0.0006687777],"about_ca_topic_score_codex":0.000023692652,"about_ca_topic_score_gemma":0.000018921304,"teacher_disagreement_score":0.95823956,"about_ca_system_score_codex":0.0002589809,"about_ca_system_score_gemma":0.00031653512,"threshold_uncertainty_score":0.99975926},"labels":[],"label_agreement":null},{"id":"W6891614947","doi":"10.4230/lipics.wabi.2025.3","title":"Approximability of Longest Run Subsequence and Complementary Minimization Problems","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada","keywords":"Subsequence; Substring; Longest increasing subsequence; Longest common subsequence problem; String (physics); Symbol (formal)","score_opus":0.014477793212230188,"score_gpt":0.2575422535346263,"score_spread":0.2430644603223961,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891614947","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08137037,0.00013163062,0.9141344,0.00049000175,0.0004661355,0.0013037893,0.00047812867,0.00011895889,0.0015066171],"genre_scores_gemma":[0.7519723,0.00009602569,0.2461034,0.0007008699,0.000042934622,0.00012683161,0.00082247896,0.000016699905,0.000118439464],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803936,0.000038321,0.00093487435,0.0003013831,0.0003143481,0.00037170094],"domain_scores_gemma":[0.998351,0.00013409586,0.00035265728,0.0008022512,0.0002619436,0.0000980894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048056978,0.00024114978,0.00035294727,0.00019400094,0.00023889261,0.0002057425,0.00093599875,0.000106213556,0.00000984625],"category_scores_gemma":[0.00005318853,0.00021016756,0.00008268636,0.00037618048,0.0001741389,0.0017003098,0.0008540798,0.00017440227,0.0000040222326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041029448,0.0030691673,0.19306614,0.013319795,0.0006486025,0.000008437158,0.028819935,0.0020371429,0.0011876186,0.35799795,0.020739038,0.37869588],"study_design_scores_gemma":[0.0046377517,0.0004272969,0.01729448,0.00070580794,0.000057009747,0.00002849817,0.0008756571,0.91286296,0.0036395683,0.012064107,0.046703536,0.0007033584],"about_ca_topic_score_codex":0.00005813863,"about_ca_topic_score_gemma":0.000016509957,"teacher_disagreement_score":0.9108258,"about_ca_system_score_codex":0.00006402258,"about_ca_system_score_gemma":0.000084922445,"threshold_uncertainty_score":0.85703844},"labels":[],"label_agreement":null},{"id":"W6891621332","doi":"10.4230/oasics.fab.2021.4","title":"TimeFabric: Trusted Time for Permissioned Blockchains","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Timestamp; Database transaction; Overhead (engineering); Popularity; Cache; Blockchain; Throughput","score_opus":0.01121591023393957,"score_gpt":0.24739395347187867,"score_spread":0.23617804323793912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891621332","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027063368,0.00019083434,0.9553042,0.0016338697,0.0017550298,0.0020554063,0.0022714771,0.00059939164,0.009126446],"genre_scores_gemma":[0.725077,0.00005616063,0.22435783,0.006332287,0.0011283741,0.0012433259,0.0054984195,0.00022826085,0.03607837],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99670815,0.00004961077,0.001266835,0.00047754715,0.00054429873,0.00095355435],"domain_scores_gemma":[0.9969713,0.00020902109,0.00045039697,0.0012002155,0.00081261946,0.0003564469],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056676735,0.00044906407,0.0006639017,0.00016278245,0.0005414542,0.0006978078,0.0012975036,0.0002881909,0.00007352183],"category_scores_gemma":[0.0002058362,0.0004081699,0.00045347514,0.00060367206,0.00006337579,0.0011497074,0.00041176396,0.0002694641,0.00031392364],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000708564,0.0043088733,0.0021798161,0.005578531,0.001964938,0.00020049747,0.03628355,0.002304558,0.008336488,0.1777426,0.5364708,0.22392084],"study_design_scores_gemma":[0.003954049,0.0001996778,0.0001992593,0.00021234418,0.000035040357,0.00017031167,0.00039202144,0.498538,0.0028551244,0.0005832436,0.49218285,0.0006781012],"about_ca_topic_score_codex":0.000005494224,"about_ca_topic_score_gemma":0.0000037923498,"teacher_disagreement_score":0.73094636,"about_ca_system_score_codex":0.00013011435,"about_ca_system_score_gemma":0.000256329,"threshold_uncertainty_score":0.99983704},"labels":[],"label_agreement":null},{"id":"W6891626384","doi":"10.4230/lipics.opodis.2022.6","title":"The Step Complexity of Multidimensional Approximate Agreement","year":2023,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Convex hull; Computational complexity theory; Upper and lower bounds; Set (abstract data type); Time complexity; Measure (data warehouse); Regular polygon; Approximation algorithm","score_opus":0.03932867486288999,"score_gpt":0.27307863806881294,"score_spread":0.23374996320592295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891626384","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24530363,0.00026649755,0.70878893,0.002175701,0.0053142845,0.0041115833,0.0007139143,0.0012079176,0.032117568],"genre_scores_gemma":[0.9209417,0.00014070347,0.07555323,0.00058250024,0.00020359544,0.00024206971,0.00039905522,0.0000472686,0.0018898733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971484,0.000059895418,0.0010225094,0.0002672793,0.00068579224,0.0008161525],"domain_scores_gemma":[0.9975882,0.0003493086,0.0005009067,0.0009912335,0.00039573116,0.0001745856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012673496,0.0003161174,0.00039514102,0.00017042438,0.00070292054,0.00022722731,0.0015556567,0.000121339595,0.000015309954],"category_scores_gemma":[0.00013939136,0.00021278596,0.00028054195,0.000558371,0.00035643467,0.0006980593,0.0011304115,0.00025581318,0.00035448268],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013580754,0.0005430811,0.0047451193,0.00076644967,0.00036602234,0.000009074507,0.016302159,0.00025706814,0.00021814379,0.90135807,0.037807774,0.037491214],"study_design_scores_gemma":[0.0033512318,0.0003578546,0.006195481,0.00013898236,0.000029916913,0.00003298534,0.0015631702,0.83773637,0.0021466424,0.009188581,0.13864917,0.0006096408],"about_ca_topic_score_codex":0.000018585444,"about_ca_topic_score_gemma":0.00003431172,"teacher_disagreement_score":0.89216954,"about_ca_system_score_codex":0.00007996541,"about_ca_system_score_gemma":0.00009548265,"threshold_uncertainty_score":0.867716},"labels":[],"label_agreement":null},{"id":"W6891641062","doi":"10.4230/dagrep.14.6.52","title":"Geometric modeling: Challenges for Additive Manufacturing, Design and Analysis (Dagstuhl Seminar 24241)","year":2024,"lang":"en","type":"report","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Geometric modeling; Geometric design; Working life; Working group","score_opus":0.08610964884947203,"score_gpt":0.3220765428645641,"score_spread":0.23596689401509208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891641062","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024416823,0.037241325,0.6882623,0.0004622155,0.007308619,0.030440656,0.1683313,0.0037617853,0.039774977],"genre_scores_gemma":[0.6126876,0.06832053,0.1297117,0.0008329931,0.0056015933,0.019828537,0.1327946,0.0068112733,0.023411158],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.98559195,0.00019827156,0.0051205433,0.0022075092,0.0036528418,0.0032288865],"domain_scores_gemma":[0.9885744,0.0017060094,0.0031163713,0.0025683837,0.0029543212,0.0010805317],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","research_integrity"],"category_scores_codex":[0.0065562967,0.0032138673,0.004760953,0.010602567,0.0008462994,0.0015595428,0.0020082921,0.002597801,0.00015947524],"category_scores_gemma":[0.0014456017,0.003014986,0.0031521667,0.0026405691,0.00043549106,0.0020056975,0.0013853764,0.0025585152,0.000843207],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0048928624,0.003691687,0.00051382557,0.08987207,0.14386211,0.0004969686,0.048954997,0.052478734,0.00005025372,0.002100541,0.39752594,0.25556],"study_design_scores_gemma":[0.004446589,0.0013602715,0.00010296183,0.0022399938,0.021403907,0.00046779707,0.003675871,0.361141,0.0015974031,0.002226095,0.5965566,0.0047815037],"about_ca_topic_score_codex":0.00010517961,"about_ca_topic_score_gemma":0.0000966278,"teacher_disagreement_score":0.5882708,"about_ca_system_score_codex":0.0025191454,"about_ca_system_score_gemma":0.0013047882,"threshold_uncertainty_score":0.99993473},"labels":[],"label_agreement":null},{"id":"W6891642036","doi":"10.4230/lipics.aft.2024.23","title":"A Shortfall in Investor Expectations of Leveraged Tokens","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Autorité des Marchés Financiers","keywords":"Leverage (statistics); Transparency (behavior); Cryptocurrency; Audit; Financial market; Price discovery; Work (physics)","score_opus":0.013719740893647133,"score_gpt":0.2591786933417796,"score_spread":0.24545895244813248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891642036","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5374531,0.00051441573,0.45358673,0.0020038872,0.0007882564,0.0013712139,0.00021909167,0.0007003179,0.0033629609],"genre_scores_gemma":[0.9624248,0.000036543064,0.03682403,0.00022417202,0.000029801067,0.0002862698,0.00006959111,0.000016886937,0.00008788985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981842,0.000024130566,0.0008776458,0.0002656122,0.00024417625,0.00040422406],"domain_scores_gemma":[0.998715,0.00015488396,0.00014305976,0.00077358086,0.00012720833,0.00008629109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039355908,0.0002137167,0.0003003918,0.0005754933,0.00012603434,0.00015322832,0.0010424441,0.00022087921,0.000011513696],"category_scores_gemma":[0.00005535106,0.00020338774,0.0001520409,0.00087471487,0.00013053548,0.0008271237,0.0002959472,0.00042284338,0.000053728796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020655103,0.00047574672,0.0028128242,0.000718752,0.00013662287,0.00001257549,0.04509155,0.00013668895,0.00034651175,0.9143361,0.006291416,0.029620556],"study_design_scores_gemma":[0.0023435059,0.00044225474,0.0020299791,0.00047148557,0.00004578311,0.00013236805,0.0049064243,0.8092777,0.0069208685,0.049329393,0.12305352,0.0010467183],"about_ca_topic_score_codex":0.00001921252,"about_ca_topic_score_gemma":0.00006908223,"teacher_disagreement_score":0.8650067,"about_ca_system_score_codex":0.00009534985,"about_ca_system_score_gemma":0.00011720316,"threshold_uncertainty_score":0.8293911},"labels":[],"label_agreement":null},{"id":"W6891653032","doi":"10.4230/lipics.sat.2025.18","title":"Towards Practical First-Order Model Counting","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Alliance de recherche numérique du Canada","keywords":"Inference; Scalability; Domain (mathematical analysis); Code (set theory); Function (biology); State (computer science); Scale (ratio)","score_opus":0.03395770335754854,"score_gpt":0.34158758421404917,"score_spread":0.3076298808565006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891653032","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035666234,0.000027546821,0.96405405,0.0019777748,0.0013293624,0.00090658927,0.000064134496,0.00039044753,0.027683483],"genre_scores_gemma":[0.059716918,0.000030450901,0.9365275,0.0026960433,0.00007585251,0.00020211436,0.00006771593,0.00002778122,0.0006556373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968224,0.000054951834,0.0012601973,0.0003940914,0.0006343763,0.0008339497],"domain_scores_gemma":[0.9971504,0.00022956036,0.0004724589,0.0012954391,0.00069151906,0.00016057368],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016171572,0.0003953605,0.00043428768,0.00036515197,0.0005690097,0.0007463239,0.0015873085,0.0003104881,0.000013679911],"category_scores_gemma":[0.0010563588,0.00037347287,0.00020216193,0.00086875254,0.00013920947,0.0037936908,0.0008329902,0.0005763958,0.000115887124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010240765,0.00041288201,0.00095393305,0.0009952012,0.00017713521,0.0000034439138,0.0063505727,0.004439036,0.00005222932,0.93755877,0.016135678,0.032818682],"study_design_scores_gemma":[0.0010890231,0.00006971286,0.00021679587,0.00011686794,0.000029154797,0.000024453824,0.0002492822,0.9154094,0.0009066035,0.0069711762,0.0745462,0.0003713402],"about_ca_topic_score_codex":0.000014718694,"about_ca_topic_score_gemma":0.000008696408,"teacher_disagreement_score":0.93058765,"about_ca_system_score_codex":0.00025490377,"about_ca_system_score_gemma":0.0004171454,"threshold_uncertainty_score":0.99987173},"labels":[],"label_agreement":null},{"id":"W6891654700","doi":"10.4230/artifacts.22479","title":"torus packing for multisets","year":2024,"lang":"en","type":"other","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Multiset; Dimension (graph theory); Torus; Integer (computer science); Conjecture; Grid; Property (philosophy)","score_opus":0.024284106277250184,"score_gpt":0.31355492803457713,"score_spread":0.28927082175732693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891654700","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042642615,0.0025211445,0.015033457,0.00021193436,0.01335128,0.016482845,0.11787962,0.005774669,0.8283186],"genre_scores_gemma":[0.0047600195,0.00022527906,0.045614123,0.0014429794,0.004544492,0.0041132793,0.021879334,0.01367222,0.9037483],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99302053,0.000052400937,0.0024461676,0.00094838213,0.0011838023,0.0023486973],"domain_scores_gemma":[0.99512124,0.0002401464,0.0017184892,0.001962113,0.00038801302,0.00057002145],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","insufficient_payload"],"category_scores_codex":[0.0010109204,0.0019008453,0.0018814382,0.0017859373,0.0002962002,0.0010300303,0.0016713432,0.0016750764,0.0011549009],"category_scores_gemma":[0.00035848047,0.0017835269,0.0014166668,0.00058315974,0.0003119822,0.0008369748,0.00068459334,0.0012121244,0.02485487],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020716205,0.00026017762,0.00013744297,0.008232038,0.0014204831,0.000015601216,0.0034870326,0.000010017846,0.00003171197,0.002450755,0.97933507,0.004412483],"study_design_scores_gemma":[0.004931255,0.00027050707,0.000013131418,0.0031663273,0.0006251241,0.000070633505,0.0008611609,0.0054643266,0.00017842834,0.0006094914,0.98181003,0.0019995607],"about_ca_topic_score_codex":0.000104107094,"about_ca_topic_score_gemma":0.0003347953,"teacher_disagreement_score":0.09600029,"about_ca_system_score_codex":0.0007188014,"about_ca_system_score_gemma":0.00023575667,"threshold_uncertainty_score":0.9997582},"labels":[],"label_agreement":null},{"id":"W6891662472","doi":"10.4230/lipics.icalp.2019","title":"LIPIcs, Volume 132, ICALP'19, Complete Volume","year":2019,"lang":"en","type":"other","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"","field":"","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"","score_opus":0.020988369666042388,"score_gpt":0.2584578098891542,"score_spread":0.23746944022311178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891662472","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00054113264,0.00071588997,0.010983838,0.0005301609,0.0089371,0.010965224,0.07715387,0.004155676,0.8860171],"genre_scores_gemma":[0.002495524,0.00014292018,0.012696889,0.0027159287,0.0026748483,0.0006275587,0.022998596,0.006261186,0.94938654],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.98853964,0.00020125773,0.0038776586,0.0013590807,0.0024914215,0.0035309356],"domain_scores_gemma":[0.98955405,0.000215651,0.003697109,0.004539455,0.000694353,0.0012993856],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"category_scores_codex":[0.001323317,0.0028316868,0.0034255648,0.0021734897,0.00052805897,0.0011270056,0.003978009,0.0026570233,0.007784879],"category_scores_gemma":[0.00047848822,0.0028186487,0.0017005949,0.000979881,0.000930754,0.001379334,0.0016031304,0.002620192,0.18863884],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002441762,0.0005662831,0.0041140956,0.0038013281,0.0011222044,0.000017545812,0.0018034724,0.000044694392,0.000020025007,0.0017035502,0.9852289,0.0013337398],"study_design_scores_gemma":[0.00705449,0.00046931862,0.00028953212,0.0010934717,0.00048216793,0.00012657011,0.00066549296,0.016018549,0.0000120908235,0.00013764868,0.9705353,0.003115365],"about_ca_topic_score_codex":0.00046015237,"about_ca_topic_score_gemma":0.0002892016,"teacher_disagreement_score":0.18085396,"about_ca_system_score_codex":0.0011442226,"about_ca_system_score_gemma":0.00056952937,"threshold_uncertainty_score":0.99990994},"labels":[],"label_agreement":null},{"id":"W6891668491","doi":"10.4230/lipics.itp.2024.10","title":"Duper: A Proof-Producing Superposition Theorem Prover for Dependent Type Theory","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Automated theorem proving; Gas meter prover; Superposition principle; Proof assistant; Type (biology); Calculus (dental); Generalization","score_opus":0.016810478464906204,"score_gpt":0.25659395859387646,"score_spread":0.23978348012897024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891668491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0112184035,0.00069512543,0.9750849,0.00031185898,0.004216223,0.0037570612,0.000079520585,0.00068307476,0.003953837],"genre_scores_gemma":[0.9846632,0.000022857383,0.011973055,0.00047613785,0.00053130614,0.0005887403,0.00024411293,0.000061919694,0.0014386667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972738,0.00006959343,0.00086948165,0.00052106415,0.00047609024,0.000789972],"domain_scores_gemma":[0.99819434,0.00023448771,0.00018545515,0.0008676052,0.0003573839,0.00016074748],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018243501,0.00039886625,0.0003822965,0.00025576915,0.00037932175,0.0013304949,0.0010248966,0.00022352925,0.000019485984],"category_scores_gemma":[0.00015131201,0.0003050133,0.00029266777,0.00039268815,0.00008539033,0.0021047874,0.00032084674,0.00031232584,0.0001862196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013976744,0.00019845903,0.00028064873,0.0020606979,0.00025562657,0.000010485832,0.020472502,0.000050289676,0.00024075608,0.86120665,0.003083811,0.1120003],"study_design_scores_gemma":[0.0042136596,0.00249244,0.00011207334,0.00062274555,0.00024346344,0.0005297635,0.0024363897,0.30107003,0.01719292,0.2569733,0.41196662,0.0021465973],"about_ca_topic_score_codex":0.000011195938,"about_ca_topic_score_gemma":0.000010431459,"teacher_disagreement_score":0.9734448,"about_ca_system_score_codex":0.00017450286,"about_ca_system_score_gemma":0.00018418765,"threshold_uncertainty_score":0.9999402},"labels":[],"label_agreement":null},{"id":"W6891668506","doi":"10.4230/lipics.ccc.2025.34","title":"Witness Encryption and NP-Hardness of Learning","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Encryption; Witness; Reduction (mathematics); Complement (music); Probabilistic encryption; 40-bit encryption","score_opus":0.006939146569976057,"score_gpt":0.24628382860903614,"score_spread":0.2393446820390601,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891668506","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23318578,0.00012971931,0.7626143,0.00018968048,0.0006594219,0.00045273238,0.000118582335,0.00014428255,0.002505485],"genre_scores_gemma":[0.97466457,0.00009986527,0.024620071,0.00030358738,0.000032472057,0.00004560396,0.00017010352,0.000010145117,0.000053599426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99831754,0.000042555355,0.0007246441,0.00024355238,0.00028385638,0.00038783782],"domain_scores_gemma":[0.99865913,0.00013252406,0.0003076966,0.00056667253,0.00023517966,0.0000988059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005907231,0.00023494306,0.00035423014,0.00038357393,0.00029109098,0.00025704963,0.00078668207,0.00015235481,0.0000075011226],"category_scores_gemma":[0.00009914035,0.00022031752,0.00014265183,0.0006119007,0.00017797024,0.0017749789,0.0005585594,0.00030751646,0.000007745281],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001309217,0.00032552195,0.04297918,0.0019130021,0.00019294789,0.000002444369,0.011693177,0.000095151365,0.00041446192,0.8877453,0.0021518357,0.05235606],"study_design_scores_gemma":[0.017728519,0.0014892215,0.058465417,0.0019703093,0.0003113414,0.00017298674,0.009149742,0.3344392,0.014366279,0.12597893,0.43290222,0.0030258754],"about_ca_topic_score_codex":0.000017855025,"about_ca_topic_score_gemma":0.0000076102506,"teacher_disagreement_score":0.7617664,"about_ca_system_score_codex":0.000027910439,"about_ca_system_score_gemma":0.00006009359,"threshold_uncertainty_score":0.8984288},"labels":[],"label_agreement":null},{"id":"W6891677303","doi":"10.4230/lipics.cp.2024.7","title":"Cumulative Scheduling with Calendars and Overtime","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Overtime; Constraint (computer-aided design); Scheduling (production processes); Task (project management); Duration (music); Resource constraints; Constraint programming; Time constraint; Decomposition","score_opus":0.06126456549689985,"score_gpt":0.367827641617658,"score_spread":0.30656307612075817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891677303","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85008645,0.00045241852,0.12939568,0.0009149711,0.0007560254,0.0014803361,0.0008569161,0.00038852033,0.015668688],"genre_scores_gemma":[0.9532938,0.000024476296,0.04448489,0.0005933753,0.00019334613,0.00006993625,0.00008269641,0.00007296882,0.0011844813],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951026,0.00008576239,0.0016760136,0.00062736444,0.0016462306,0.0008620193],"domain_scores_gemma":[0.9963326,0.0017103546,0.00038774087,0.0007518356,0.000461997,0.0003555064],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002767213,0.00051948224,0.0006630492,0.0007996129,0.00045976826,0.0020277544,0.00081566273,0.00025989398,0.00021886583],"category_scores_gemma":[0.0011428152,0.00035445872,0.00025447342,0.0010427138,0.0004674301,0.0024114568,0.0003659421,0.00072432635,0.0003440857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002744912,0.00067646295,0.09806982,0.0032589214,0.0029065493,0.0003651594,0.240678,0.01982963,0.0010235673,0.07511989,0.017837463,0.53748965],"study_design_scores_gemma":[0.0038169557,0.00075369945,0.0019055152,0.0011526,0.00016733224,0.000641775,0.019143423,0.7882156,0.0013591646,0.0070067984,0.17438725,0.0014498889],"about_ca_topic_score_codex":0.000018663175,"about_ca_topic_score_gemma":0.000017738543,"teacher_disagreement_score":0.76838595,"about_ca_system_score_codex":0.00011909912,"about_ca_system_score_gemma":0.00024311332,"threshold_uncertainty_score":0.99989074},"labels":[],"label_agreement":null},{"id":"W6891678007","doi":"10.4230/lipics.cpm.2023.2","title":"Approximation Algorithms for the Longest Run Subsequence Problem","year":2023,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada","keywords":"Substring; Subsequence; Longest increasing subsequence; Longest common subsequence problem; String (physics); Symbol (formal); Sequence (biology); Bounded function","score_opus":0.036994911951309994,"score_gpt":0.2847968448206783,"score_spread":0.2478019328693683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891678007","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028047625,0.000069151756,0.98985946,0.0015992522,0.0012262376,0.002584314,0.00063461025,0.00061854074,0.00060368166],"genre_scores_gemma":[0.11691121,0.00041691822,0.8684203,0.0026545373,0.0012074802,0.0040497375,0.004249345,0.00017093422,0.0019195274],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971327,0.000031469088,0.0009238931,0.0003972519,0.00063278235,0.0008818778],"domain_scores_gemma":[0.9972912,0.00048063637,0.00044183937,0.0012465934,0.00037129837,0.00016839949],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012385717,0.00037167742,0.0003373098,0.00023010289,0.00092127966,0.00087526406,0.0023204363,0.00018330189,0.000008134223],"category_scores_gemma":[0.00010938151,0.00025787504,0.00023066177,0.0007826544,0.00012279907,0.0028247978,0.00081906235,0.00030452327,0.00021072986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016915215,0.0005351896,0.0011726483,0.0020847942,0.00038785188,0.000015011273,0.021364275,0.004703751,0.00034434258,0.1726294,0.10363042,0.6929632],"study_design_scores_gemma":[0.0013506125,0.00017419814,0.00058809586,0.00010911222,0.00002250209,0.00003269599,0.00046740976,0.8827728,0.00061393843,0.0053990087,0.10807515,0.0003944827],"about_ca_topic_score_codex":0.000024316068,"about_ca_topic_score_gemma":0.0000088493725,"teacher_disagreement_score":0.87806904,"about_ca_system_score_codex":0.000094062954,"about_ca_system_score_gemma":0.00010589864,"threshold_uncertainty_score":0.99998736},"labels":[],"label_agreement":null},{"id":"W6891680282","doi":"10.4230/lipics.giscience.2023.16","title":"When Everything Is \"Nearby\": How Airbnb Listings in New York City Exaggerate Proximity (Short Paper)","year":2023,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Sharing Economy and Platforms","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Renting; Real estate; Warrant; Order (exchange); Geocoding; Destinations","score_opus":0.05327610536547876,"score_gpt":0.23723216618399465,"score_spread":0.1839560608185159,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891680282","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9718499,0.000032198943,0.0011348588,0.0031521851,0.0014833865,0.0017171385,0.00013866609,0.00082099676,0.019670626],"genre_scores_gemma":[0.98128206,0.00002238672,0.0018077628,0.0092558935,0.0015091304,0.00013012288,0.0011007326,0.0001064022,0.004785499],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969174,0.000007333148,0.0010631791,0.00043411684,0.00045172838,0.0011262067],"domain_scores_gemma":[0.9985038,0.00013123955,0.00048410558,0.0006183421,0.00017300033,0.00008947916],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001313961,0.00053747493,0.00061369844,0.00066201756,0.0004942907,0.0018814214,0.0008209359,0.00032950213,0.00031431447],"category_scores_gemma":[0.0003174146,0.0005045589,0.0002803803,0.00088472886,0.00007513691,0.008250927,0.0005847682,0.00066645484,0.00079088536],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034620272,0.00030100672,0.66264695,0.0034055456,0.00031085438,0.000033190398,0.018133897,0.00025687684,0.000047260422,0.00892027,0.26823944,0.03735854],"study_design_scores_gemma":[0.0036990042,0.000058771293,0.051042017,0.00081928924,0.00010346176,0.000016611484,0.0039388286,0.08203208,0.00018608729,0.012461371,0.84398496,0.001657517],"about_ca_topic_score_codex":0.00079643057,"about_ca_topic_score_gemma":0.00056957436,"teacher_disagreement_score":0.6116049,"about_ca_system_score_codex":0.00013268951,"about_ca_system_score_gemma":0.00010779503,"threshold_uncertainty_score":0.9999871},"labels":[],"label_agreement":null},{"id":"W6891699754","doi":"10.4230/lipics.sat.2024.27","title":"Revisiting SATZilla Features in 2024","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Satisfiability; Preprocessor; Feature selection; Benchmark (surveying); Feature (linguistics); Boolean satisfiability problem; Ranging; Software","score_opus":0.01815246545251966,"score_gpt":0.3067046303418024,"score_spread":0.28855216488928276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891699754","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029624011,0.0013894697,0.92034054,0.001440623,0.0062074163,0.0017055019,0.00018446463,0.0010071475,0.038100824],"genre_scores_gemma":[0.281825,0.00019004803,0.713791,0.0013083693,0.00059820944,0.00024096381,0.00014439881,0.00007752216,0.0018244468],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971529,0.00007821296,0.0011211078,0.00040071981,0.0005060698,0.0007409505],"domain_scores_gemma":[0.9983585,0.00024462782,0.00020701032,0.0009056254,0.00013867913,0.00014554286],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017457459,0.00035708668,0.00037611715,0.00058216025,0.00018518548,0.0011538821,0.0013623455,0.00023690223,0.000027710712],"category_scores_gemma":[0.00028852155,0.00032057974,0.00021953431,0.0010103645,0.00007791682,0.0029255764,0.00046766072,0.0006909779,0.00028516317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044733068,0.000095656425,0.0016338892,0.0022400091,0.00010976231,0.000037642058,0.016868332,0.0003315362,0.00023825295,0.63296074,0.012263698,0.33317578],"study_design_scores_gemma":[0.001343747,0.0001976355,0.0038271148,0.0015805024,0.00003295739,0.00030787202,0.0011188685,0.55560714,0.003251901,0.0078775445,0.42373368,0.0011210053],"about_ca_topic_score_codex":0.000015531457,"about_ca_topic_score_gemma":0.000006845614,"teacher_disagreement_score":0.6250832,"about_ca_system_score_codex":0.0002405975,"about_ca_system_score_gemma":0.00010673856,"threshold_uncertainty_score":0.9999246},"labels":[],"label_agreement":null},{"id":"W6891717383","doi":"10.4230/lipics.giscience.2023.0","title":"Front Matter, Table of Contents, Preface, Conference Organization","year":2023,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Diverse Scientific and Economic Studies","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Table (database); Front (military); Table of contents; Front office; Front and back ends","score_opus":0.040097298932838636,"score_gpt":0.2131662341686234,"score_spread":0.17306893523578476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891717383","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48306033,0.00031832675,0.015662463,0.0006410392,0.008583546,0.002419591,0.0215548,0.00040519962,0.4673547],"genre_scores_gemma":[0.85756534,0.0003057302,0.0011900712,0.00045509578,0.00007757776,0.00007506182,0.001189976,0.000057933008,0.1390832],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979133,0.0000057437005,0.0012362325,0.00027643234,0.00007429459,0.000494007],"domain_scores_gemma":[0.99849564,0.000043442556,0.0007227931,0.0004266437,0.00021725844,0.00009422499],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00048977823,0.0002227562,0.0005813281,0.00033506635,0.0002104646,0.00017191633,0.00045347319,0.00012474442,0.0059966007],"category_scores_gemma":[0.00012628548,0.0002403177,0.00012208191,0.00038146807,0.00013780767,0.00083048124,0.00027882608,0.00011380228,0.034140844],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004658143,0.00019761929,0.17569417,0.00060792477,0.00036846346,9.756403e-7,0.009935713,0.00024457826,0.000037688693,0.045749895,0.7667894,0.0003270293],"study_design_scores_gemma":[0.005216132,0.00016847027,0.032295633,0.00017929873,0.000049857794,0.0000075297094,0.010490432,0.021505969,0.0010252605,0.004415128,0.9235765,0.001069794],"about_ca_topic_score_codex":0.0000708154,"about_ca_topic_score_gemma":0.000007808661,"teacher_disagreement_score":0.37450504,"about_ca_system_score_codex":0.00008978424,"about_ca_system_score_gemma":0.000023040118,"threshold_uncertainty_score":0.994912},"labels":[],"label_agreement":null},{"id":"W6891721153","doi":"10.4230/lipics.giscience.2023.49","title":"How Does Travel Environment Affect Mood? A Study Using Geographic Ecological Momentary Assessment in the UK (Short Paper)","year":2023,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Urban Green Space and Health","field":"Environmental Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Affect (linguistics); Happiness; Global Positioning System; Mood; Likert scale; TRIPS architecture; Travel behavior; Phone","score_opus":0.026426920840809366,"score_gpt":0.2837767040864371,"score_spread":0.25734978324562774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891721153","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99280846,0.0000068910495,0.00047083938,0.0016179298,0.00021542837,0.0038852512,0.00019401823,0.000070642156,0.00073055783],"genre_scores_gemma":[0.99654007,0.000085646265,0.0011516601,0.0012151557,0.000068900736,0.0005775368,0.00018297971,0.000036014426,0.00014203417],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9963494,0.00019210213,0.00081506517,0.00044650555,0.0010594426,0.0011375],"domain_scores_gemma":[0.99858147,0.00024636782,0.00022375617,0.0007312011,0.000009938604,0.00020729189],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019944997,0.00047832268,0.00051499094,0.00023427965,0.00056057196,0.00028287224,0.0008293865,0.00018639863,0.00053295295],"category_scores_gemma":[0.000020838654,0.000295754,0.00024898557,0.00058007654,0.000245837,0.0008044252,0.00056255946,0.0006550907,0.00013166075],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037622056,0.0010561879,0.990117,0.00006781531,0.00007729648,0.000025838386,0.006035371,0.00030922247,0.00023516748,0.00008999078,0.0012669396,0.0006815521],"study_design_scores_gemma":[0.0016454502,0.0008991876,0.9528057,0.000034793007,0.00007278933,0.000013966652,0.03105583,0.009885378,0.000023829374,0.00020953522,0.002883521,0.0004700093],"about_ca_topic_score_codex":0.0004576698,"about_ca_topic_score_gemma":0.0021946256,"teacher_disagreement_score":0.037311286,"about_ca_system_score_codex":0.0005163433,"about_ca_system_score_gemma":0.000029121666,"threshold_uncertainty_score":0.99994946},"labels":[],"label_agreement":null},{"id":"W6891741691","doi":"10.4230/lipics.itcs.2024.84","title":"Budget-Feasible Mechanism Design: Simpler, Better Mechanisms and General Payment Constraints","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Subadditivity; Oracle; Payment; Valuation (finance); Submodular set function; Set (abstract data type); Mechanism design; Value (mathematics)","score_opus":0.06626143121203233,"score_gpt":0.3509448257184785,"score_spread":0.2846833945064462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891741691","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033284727,0.00006491531,0.9590797,0.0016472522,0.0011494014,0.0013586474,0.00079724164,0.00024777986,0.00237035],"genre_scores_gemma":[0.89716786,0.00005204329,0.094585694,0.003683363,0.0003114321,0.0004548527,0.00020642672,0.0000690779,0.003469223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996329,0.00011476678,0.0014335052,0.00051906577,0.00096246536,0.0006411611],"domain_scores_gemma":[0.9976128,0.0007648952,0.00030717597,0.0007290624,0.00026893883,0.00031718006],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0027727382,0.00040089383,0.0004538529,0.0004343168,0.0005972648,0.0012874065,0.00075554644,0.00023340216,0.0008918414],"category_scores_gemma":[0.00017684013,0.00030586848,0.00025187666,0.00053473277,0.0002986219,0.0012841431,0.00032288636,0.0003545588,0.0009454012],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007922767,0.00013739242,0.00006381888,0.00012354177,0.00018346362,0.000009491713,0.004719562,0.00016850677,0.0018215562,0.88603926,0.024197014,0.082457185],"study_design_scores_gemma":[0.001397554,0.0002512204,0.000060799885,0.00008295939,0.00008020058,0.00022047632,0.003624428,0.076306246,0.0121552795,0.762574,0.14260785,0.00063900184],"about_ca_topic_score_codex":0.000004555909,"about_ca_topic_score_gemma":0.0000032983414,"teacher_disagreement_score":0.86449397,"about_ca_system_score_codex":0.00008779588,"about_ca_system_score_gemma":0.00010861967,"threshold_uncertainty_score":0.9999393},"labels":[],"label_agreement":null},{"id":"W6891765915","doi":"10.4230/lipics.opodis.2024.11","title":"Gathering Teams of Deterministic Finite Automata on a Line","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Université du Québec en Outaouais","keywords":"Task (project management); State (computer science); Set (abstract data type); Node (physics); Deterministic algorithm; Line (geometry); Integer (computer science); Time complexity","score_opus":0.01909302301479185,"score_gpt":0.29656767002335854,"score_spread":0.2774746470085667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891765915","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010689695,0.00001508362,0.9705463,0.00051567116,0.0006173859,0.00088638806,0.00013590057,0.00028145607,0.016312093],"genre_scores_gemma":[0.9055332,0.00004741948,0.09063745,0.0019169918,0.000044655222,0.00011792616,0.000114382805,0.000027973365,0.0015599809],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789447,0.000036458434,0.0009645091,0.0002315758,0.0003852755,0.00048771588],"domain_scores_gemma":[0.99811625,0.0003110742,0.00030243918,0.0008992976,0.00024720773,0.00012370749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052451465,0.00025647806,0.00036512886,0.0004053011,0.00020012342,0.00026707395,0.0012650337,0.0001308369,0.000018264396],"category_scores_gemma":[0.0002582013,0.0002274184,0.00016400155,0.0005338633,0.00009150539,0.0007203812,0.00048303895,0.00026209434,0.00006715304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005344901,0.0032252027,0.005224151,0.0066300486,0.00078847987,0.00002820317,0.030757884,0.1134453,0.00044933197,0.44172505,0.010031409,0.38716045],"study_design_scores_gemma":[0.0019784002,0.00042892632,0.00017187188,0.00038530483,0.000012458854,0.0000055488113,0.0001439332,0.97543246,0.0011052568,0.0012268146,0.018866098,0.00024290402],"about_ca_topic_score_codex":0.0000058874257,"about_ca_topic_score_gemma":0.000004169732,"teacher_disagreement_score":0.8948435,"about_ca_system_score_codex":0.00007375821,"about_ca_system_score_gemma":0.00015132008,"threshold_uncertainty_score":0.9273853},"labels":[],"label_agreement":null},{"id":"W6910172465","doi":"10.4230/lipics.giscience.2023.61","title":"Mobility Vitality: Assessing Neighborhood Similarity Through Transportation Patterns In New York City (Short Paper)","year":2023,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Human Mobility and Location-Based Analysis","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Vitality; Mobility model; Measure (data warehouse); Individual mobility; Similarity (geometry); Transportation planning","score_opus":0.06652143040895257,"score_gpt":0.3473298216363563,"score_spread":0.2808083912274037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910172465","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.949016,0.000024777497,0.04207996,0.0014094863,0.00043895844,0.0014203814,0.0006987648,0.00039427038,0.004517403],"genre_scores_gemma":[0.9960107,0.000059183807,0.00055874244,0.0008577943,0.00023260551,0.00010195765,0.0019489661,0.00002799613,0.00020202083],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99612504,0.00020286365,0.0014544711,0.00042728768,0.0008920015,0.0008983272],"domain_scores_gemma":[0.9981579,0.00040242696,0.00029398565,0.00062714884,0.00024192619,0.00027658074],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025077458,0.0003501798,0.0005703072,0.00024488053,0.0009464388,0.0005035949,0.00060626643,0.00039288966,0.00035077488],"category_scores_gemma":[0.0003550812,0.0003647152,0.00040289343,0.0013537311,0.0002562577,0.0026389959,0.000046272242,0.0005266701,0.00005624919],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006371658,0.0006677548,0.83930445,0.00056919735,0.00015411788,0.000005841251,0.1288259,0.000928477,0.000022046679,0.0059270607,0.0012083998,0.022323053],"study_design_scores_gemma":[0.003135378,0.00017035073,0.7768362,0.00045998962,0.00030113466,0.0000011389418,0.119135335,0.024897829,0.00025737498,0.020645535,0.052587725,0.0015719731],"about_ca_topic_score_codex":0.011181123,"about_ca_topic_score_gemma":0.07202308,"teacher_disagreement_score":0.062468193,"about_ca_system_score_codex":0.00041892778,"about_ca_system_score_gemma":0.00060869544,"threshold_uncertainty_score":0.9998805},"labels":[],"label_agreement":null},{"id":"W6910201977","doi":"10.4230/lipics.ccc.2024.29","title":"Exact Search-To-Decision Reductions for Time-Bounded Kolmogorov Complexity","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"University of Warwick; UK Research and Innovation","keywords":"Reduction (mathematics); Bounded function; String (physics); Measure (data warehouse); Kolmogorov complexity; Upper and lower bounds","score_opus":0.0385608933092483,"score_gpt":0.31197945965250806,"score_spread":0.2734185663432598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910201977","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018110583,0.000096632415,0.96955884,0.0021909007,0.0031725145,0.002257788,0.0012347624,0.00090543757,0.002472555],"genre_scores_gemma":[0.14570484,0.000049908955,0.84786963,0.0016082186,0.00093868707,0.0006011764,0.00081592874,0.00012786749,0.0022837352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99623114,0.00005014262,0.0011785172,0.0006453251,0.00078661315,0.0011082921],"domain_scores_gemma":[0.9969827,0.00066656154,0.00014507443,0.001307973,0.0004449511,0.0004527483],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012238172,0.0004988511,0.00054804375,0.0007841131,0.0010021762,0.0019855527,0.0020743767,0.00021028053,0.00009856112],"category_scores_gemma":[0.00016474581,0.00046277844,0.0005828827,0.0011986283,0.00027690438,0.0023667691,0.000917914,0.0005379753,0.00078467804],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026516567,0.00072941056,0.000057701036,0.0014384217,0.00050132285,0.000015585962,0.014943541,0.0007010068,0.00033875272,0.57467204,0.113034904,0.29330215],"study_design_scores_gemma":[0.0012625224,0.00052708946,0.00016580915,0.00037151534,0.00003675196,0.0001236199,0.00030977622,0.60751283,0.00083340146,0.064459436,0.32370645,0.00069082755],"about_ca_topic_score_codex":0.000026976793,"about_ca_topic_score_gemma":0.00001764626,"teacher_disagreement_score":0.6068118,"about_ca_system_score_codex":0.00025805627,"about_ca_system_score_gemma":0.0002238217,"threshold_uncertainty_score":0.9999933},"labels":[],"label_agreement":null},{"id":"W6910264862","doi":"10.4230/lipics.ccc.2023.36","title":"Colourful TFNP and Propositional Proofs","year":2023,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical proof; Unary operation; Class (philosophy); Proof complexity; Intersection (aeronautics); Resolution (logic); Propositional calculus; Analytic proof","score_opus":0.017782138798735237,"score_gpt":0.2582630661033912,"score_spread":0.24048092730465598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910264862","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40247455,0.00016854698,0.56441563,0.007472201,0.0037648655,0.0046912576,0.0013260514,0.0028290253,0.012857869],"genre_scores_gemma":[0.7741679,0.00014004059,0.21760914,0.00359829,0.000544538,0.0006916264,0.0010582195,0.00009021985,0.002100008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978239,0.000029745064,0.00064718956,0.00030739172,0.00051154697,0.00068025495],"domain_scores_gemma":[0.99866414,0.00016155699,0.00020300566,0.00055221724,0.00021094417,0.00020812835],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056746555,0.00028850458,0.0003024207,0.0003521871,0.0005680503,0.0005664908,0.0009595277,0.00014282617,0.000020051124],"category_scores_gemma":[0.000058807782,0.0002631711,0.00015333826,0.00073825935,0.00019448122,0.0014783845,0.00078038365,0.00030481038,0.00021672448],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014878798,0.0007412369,0.008416066,0.0017163913,0.00042420017,0.00006163817,0.022398671,0.00026548543,0.00019689767,0.7629217,0.059994146,0.14271481],"study_design_scores_gemma":[0.0043262136,0.0008047186,0.010116657,0.00027283782,0.000038722126,0.00034584437,0.0009434472,0.70824677,0.0011580087,0.072405085,0.20008159,0.0012601033],"about_ca_topic_score_codex":0.0000059445774,"about_ca_topic_score_gemma":0.0000072953994,"teacher_disagreement_score":0.7079813,"about_ca_system_score_codex":0.000054032866,"about_ca_system_score_gemma":0.00008892931,"threshold_uncertainty_score":0.99998206},"labels":[],"label_agreement":null},{"id":"W6910319334","doi":"10.4230/lipics.opodis.2021.28","title":"Strongly Linearizable Linked List and Queue","year":2022,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Linearizability; Correctness; Implementation; Data structure; Queue; Scheme (mathematics)","score_opus":0.010836333627335612,"score_gpt":0.23072336248391856,"score_spread":0.21988702885658296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910319334","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1859135,0.0005355973,0.78393936,0.0024642798,0.004265965,0.0029870335,0.003976505,0.00091037183,0.015007383],"genre_scores_gemma":[0.9736671,0.000021351236,0.022255408,0.0011525088,0.00018718622,0.00035649943,0.00059807656,0.000039611,0.0017222891],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99734986,0.00005780862,0.0009352714,0.00035892933,0.0005792858,0.0007188222],"domain_scores_gemma":[0.99798995,0.000088869914,0.0003896966,0.0011115058,0.00018495445,0.00023501493],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007345172,0.0003266537,0.00043398415,0.0001703626,0.0008946312,0.00071883685,0.001782911,0.00011408934,0.00004515423],"category_scores_gemma":[0.000063370615,0.00031898436,0.00015847092,0.000445761,0.00008197238,0.0014067504,0.0015259675,0.0005304169,0.000039522984],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006695277,0.0032603452,0.034013506,0.0037321527,0.0011787547,0.0001570376,0.06645034,0.016041582,0.0007603334,0.5076265,0.26495788,0.10115205],"study_design_scores_gemma":[0.0024024127,0.00034818173,0.00053050986,0.000048023667,0.000014844149,0.0001311283,0.0011032891,0.39276308,0.000081296275,0.00056315685,0.60150796,0.00050609704],"about_ca_topic_score_codex":0.00007655701,"about_ca_topic_score_gemma":0.000015483745,"teacher_disagreement_score":0.7877536,"about_ca_system_score_codex":0.00013877856,"about_ca_system_score_gemma":0.00011499642,"threshold_uncertainty_score":0.9999262},"labels":[],"label_agreement":null},{"id":"W6910320367","doi":"10.4230/lipics.icalp.2023.28","title":"Nondeterministic Interactive Refutations for Nearest Boolean Vector","year":2023,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Chinese University of Hong Kong; European Commission","keywords":"Nondeterministic algorithm; Boolean function; Cube (algebra); Randomness; Maximum satisfiability problem; Linear subspace; Matrix (chemical analysis); Two-element Boolean algebra","score_opus":0.0219407974307442,"score_gpt":0.29767691246184613,"score_spread":0.27573611503110196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910320367","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06589443,0.000018888553,0.9195063,0.0009115671,0.0026530987,0.002314729,0.005273005,0.0010181498,0.002409813],"genre_scores_gemma":[0.9316061,0.000026550812,0.06270233,0.0011687953,0.00030175154,0.000756881,0.00323485,0.00006068019,0.00014203088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975107,0.00003287889,0.0008843487,0.00038697428,0.00037794572,0.0008071796],"domain_scores_gemma":[0.9974382,0.0006548637,0.00036574883,0.00097195525,0.00032692077,0.00024232236],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004991738,0.00035576176,0.00038020159,0.0004986357,0.00060975266,0.000731906,0.0013959834,0.00016468749,0.000019989962],"category_scores_gemma":[0.00031208966,0.00034187693,0.00036552234,0.00086733326,0.0001221073,0.0024115497,0.00051874266,0.00032065882,0.0003163065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008080756,0.0014429447,0.0032286972,0.0028675082,0.00096015015,0.000056932306,0.08425197,0.00048105256,0.000496458,0.66317284,0.15207633,0.09015707],"study_design_scores_gemma":[0.006217363,0.0013244648,0.007364783,0.00034443356,0.00011899013,0.00009000998,0.00396776,0.53316844,0.0012294985,0.026759582,0.4177812,0.0016334628],"about_ca_topic_score_codex":0.000010957701,"about_ca_topic_score_gemma":0.000028035705,"teacher_disagreement_score":0.8657117,"about_ca_system_score_codex":0.00008132413,"about_ca_system_score_gemma":0.000110363486,"threshold_uncertainty_score":0.9999033},"labels":[],"label_agreement":null},{"id":"W6910341342","doi":"10.4230/lipics.opodis.2023.17","title":"A Wait-Free Deque With Polylogarithmic Step Complexity","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Amortized analysis; Stack (abstract data type); Queue; Computational complexity theory; Data structure; Time complexity","score_opus":0.01784283380366237,"score_gpt":0.24830342300751643,"score_spread":0.23046058920385407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910341342","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015416909,0.0002567087,0.96796846,0.0012179357,0.0014684518,0.0012815848,0.001760997,0.0008780069,0.009750962],"genre_scores_gemma":[0.89298433,0.00002279679,0.103572994,0.0012461167,0.00030960093,0.0002958816,0.0005322612,0.00007661266,0.00095937744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99680895,0.000041930052,0.001019077,0.00048153344,0.00070165907,0.00094685965],"domain_scores_gemma":[0.9974518,0.0001234848,0.00024269863,0.0016109378,0.00027959168,0.00029150426],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005735031,0.00049799995,0.00054947176,0.0002634483,0.00036178113,0.0015518086,0.0024149776,0.0002128118,0.000023881035],"category_scores_gemma":[0.00004305118,0.00038515797,0.00024873388,0.00072289316,0.0002051603,0.0023686462,0.00065021,0.00053380494,0.0002641555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019423054,0.0005436662,0.0019569756,0.0034560855,0.00078046205,0.00019267134,0.011321685,0.00021945579,0.00007392673,0.8215928,0.092846155,0.066821866],"study_design_scores_gemma":[0.002990855,0.00047974425,0.0008051649,0.00079732237,0.000043502005,0.00053787866,0.0005468591,0.50719726,0.00021625165,0.0035134398,0.48193917,0.0009325703],"about_ca_topic_score_codex":0.000095539624,"about_ca_topic_score_gemma":0.00011834374,"teacher_disagreement_score":0.87756747,"about_ca_system_score_codex":0.00019115361,"about_ca_system_score_gemma":0.00021478695,"threshold_uncertainty_score":0.99986005},"labels":[],"label_agreement":null},{"id":"W6910364688","doi":"10.4230/lipics.socg.2025.18","title":"Finding a Shortest Curve That Separates Few Objects from Many","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Disjoint sets; Polygon (computer graphics); Graph; Line segment; Polygonal chain; Monotone polygon; Set (abstract data type); Shortest path problem","score_opus":0.021849879915498065,"score_gpt":0.2837568478144151,"score_spread":0.26190696789891704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910364688","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21576357,0.00019649614,0.77264017,0.0005250613,0.0019992895,0.0008112993,0.00024296147,0.00027891705,0.0075422516],"genre_scores_gemma":[0.95526165,0.000032439173,0.04083235,0.0017639899,0.00015588543,0.00010518539,0.0007479154,0.000016566202,0.0010840475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978269,0.000044755143,0.0007558733,0.00037245717,0.00044324703,0.000556819],"domain_scores_gemma":[0.99829656,0.00039091642,0.0002860043,0.0006407867,0.00024353093,0.0001421886],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042898307,0.00035007304,0.00037375046,0.00044930656,0.00047179044,0.0008633077,0.0010561235,0.00017722957,0.00002962686],"category_scores_gemma":[0.00009614007,0.0003362578,0.00021158742,0.0007684108,0.000053353087,0.0019347433,0.00048811047,0.00028527388,0.00015143858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047265587,0.002198422,0.10240615,0.001740284,0.002360789,0.00006646538,0.06784237,0.03057584,0.0019462894,0.4434309,0.12955543,0.2174044],"study_design_scores_gemma":[0.0033371614,0.00021851646,0.014672107,0.0004344146,0.000082584535,0.000029649325,0.0009280223,0.86836106,0.013379658,0.021550156,0.07597295,0.001033746],"about_ca_topic_score_codex":0.00002890219,"about_ca_topic_score_gemma":0.00003991782,"teacher_disagreement_score":0.8377852,"about_ca_system_score_codex":0.00014565652,"about_ca_system_score_gemma":0.00019492119,"threshold_uncertainty_score":0.9999089},"labels":[],"label_agreement":null},{"id":"W6910399977","doi":"10.4230/lipics.cp.2022.10","title":"A Constraint Programming Approach to Ship Refit Project Scheduling","year":2022,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; Thales (Canada)","funders":"","keywords":"Constraint programming; Scheduling (production processes); Project management; Baseline (sea); Speedup; Heuristic; Plan (archaeology); Work order; Constraint (computer-aided design)","score_opus":0.12577343677338768,"score_gpt":0.37385547381011147,"score_spread":0.2480820370367238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910399977","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65166074,0.000099386845,0.26856765,0.0012172168,0.0018084893,0.010726803,0.0017560265,0.0008412248,0.063322455],"genre_scores_gemma":[0.7105038,0.0000020271787,0.28471643,0.0016795383,0.0002366814,0.0017774414,0.00032460265,0.000098416705,0.0006610199],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9894607,0.00037771434,0.0034393815,0.0010809094,0.0037402352,0.0019010815],"domain_scores_gemma":[0.99455804,0.0011467129,0.0012607937,0.0017425045,0.0007351348,0.0005568393],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.010631741,0.0007668986,0.0011108277,0.0017894917,0.0018723699,0.0019689526,0.0034007868,0.00026084017,0.0002066452],"category_scores_gemma":[0.0037101419,0.00066609576,0.0007166619,0.0030131617,0.00036399715,0.0012838749,0.0019276987,0.001550355,0.00024695354],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026540132,0.0036510108,0.038109608,0.0013725187,0.0011507345,0.00008400716,0.26003644,0.06151406,0.00063007756,0.059171528,0.014904907,0.5567211],"study_design_scores_gemma":[0.0061422875,0.0014082686,0.00038189904,0.00018201188,0.00012321165,0.0011174704,0.19918832,0.17795125,0.0004540192,0.002351642,0.6083327,0.002366899],"about_ca_topic_score_codex":0.000045629255,"about_ca_topic_score_gemma":0.000010320905,"teacher_disagreement_score":0.59342784,"about_ca_system_score_codex":0.00049983326,"about_ca_system_score_gemma":0.0006609384,"threshold_uncertainty_score":0.999579},"labels":[],"label_agreement":null},{"id":"W6910408406","doi":"10.4230/lipics.esa.2022.59","title":"Faster Path Queries in Colored Trees via Sparse Matrix Multiplication and Min-Plus Product","year":2022,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Path (computing); Matrix multiplication; Matrix (chemical analysis); Range query (database); Colored; Tree (set theory); Element (criminal law); Product (mathematics); Node (physics)","score_opus":0.01677952594851535,"score_gpt":0.28010107376614735,"score_spread":0.263321547817632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910408406","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78361064,0.0002203901,0.210615,0.00084401114,0.0004602948,0.0031832089,0.000336119,0.000247283,0.0004830693],"genre_scores_gemma":[0.961585,0.0000289708,0.036470816,0.00028810184,0.00004388941,0.00088873977,0.00017941228,0.000035450346,0.00047964646],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971489,0.0001362026,0.0008672629,0.00046420505,0.0006261894,0.00075728446],"domain_scores_gemma":[0.9981684,0.00018579325,0.00033323272,0.0009789902,0.00016943757,0.00016412567],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001027199,0.00032753326,0.00040413855,0.0005138989,0.0005095198,0.00027936773,0.0012540728,0.000071727554,0.00002143227],"category_scores_gemma":[0.000108290275,0.00031774014,0.00010607901,0.0007563297,0.00020108596,0.0019792207,0.0013979162,0.00049376563,0.000026746913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0053547504,0.0038437585,0.16376062,0.0035714714,0.0006372721,0.00017649539,0.22344516,0.018998781,0.011877977,0.25865412,0.007451752,0.30222782],"study_design_scores_gemma":[0.012333002,0.0016423467,0.018661488,0.00014183093,0.00003526615,0.0004453105,0.008793923,0.83644176,0.0048307595,0.019702636,0.0950411,0.0019306026],"about_ca_topic_score_codex":0.000027247155,"about_ca_topic_score_gemma":0.00005603959,"teacher_disagreement_score":0.81744295,"about_ca_system_score_codex":0.0002588882,"about_ca_system_score_gemma":0.00010265239,"threshold_uncertainty_score":0.99992746},"labels":[],"label_agreement":null},{"id":"W6910433705","doi":"10.4230/lipics.ecrts.2024.0","title":"Front Matter, Table of Contents, Preface, Conference Organization","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Diverse Scientific and Economic Studies","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Table (database); Front (military); Table of contents; Front office; Front and back ends","score_opus":0.030268111021064095,"score_gpt":0.21037886311000928,"score_spread":0.18011075208894517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910433705","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17876911,0.0026892326,0.06227232,0.00074162934,0.014967037,0.0024936683,0.025336783,0.0003834452,0.7123468],"genre_scores_gemma":[0.88751376,0.00030056297,0.0016773727,0.00036282602,0.00009309892,0.00005316147,0.000573702,0.000053637857,0.10937191],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980035,0.00000503292,0.0012106608,0.0003032643,0.00006728594,0.00041026837],"domain_scores_gemma":[0.9989184,0.000043399115,0.0004102962,0.00036940543,0.00017100076,0.00008749954],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0004093686,0.00023140937,0.000534704,0.00028425027,0.0001518928,0.00035377938,0.00039056325,0.00012514423,0.0091740005],"category_scores_gemma":[0.00007340255,0.00023835627,0.00013784223,0.00024312861,0.000137831,0.0010895451,0.00020157664,0.00014215322,0.01984427],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004667413,0.00025478698,0.058771964,0.0017185879,0.0006962729,0.0000019548847,0.013920215,0.00012974621,0.00004613339,0.16581014,0.7577868,0.0008167069],"study_design_scores_gemma":[0.0016768791,0.000101171565,0.0030861218,0.00025440732,0.000045801033,0.000010210013,0.003476575,0.018357676,0.0006331746,0.0031748724,0.96856815,0.0006149762],"about_ca_topic_score_codex":0.000068351444,"about_ca_topic_score_gemma":0.0000066667058,"teacher_disagreement_score":0.70874465,"about_ca_system_score_codex":0.000121237055,"about_ca_system_score_gemma":0.00003236891,"threshold_uncertainty_score":0.99173176},"labels":[],"label_agreement":null},{"id":"W6910447097","doi":"10.4230/lipics.itcs.2025.93","title":"Polynomials, Divided Differences, and Codes","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Environment and Climate Change Canada; Israel Science Foundation; European Commission","keywords":"Multiplicity (mathematics); Decodes; Finite field; List decoding; Reed–Muller code; Decoding methods; Degree (music); Finite set; Linear code","score_opus":0.009595065195354174,"score_gpt":0.23929865331196112,"score_spread":0.22970358811660696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910447097","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40395406,0.00030373858,0.5813714,0.0011646587,0.0013440446,0.0008722714,0.000183092,0.00045710284,0.010349608],"genre_scores_gemma":[0.9833385,0.000074557865,0.014481781,0.0015809304,0.000053337862,0.00007735491,0.00003207629,0.000011733789,0.00034977376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981861,0.000053152347,0.00068151526,0.00029057544,0.000241931,0.0005467027],"domain_scores_gemma":[0.99850285,0.00031307776,0.00020711805,0.0007095416,0.000118412114,0.00014899315],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056984846,0.00031422882,0.00041041616,0.0003818655,0.00047130042,0.0006968969,0.0011887294,0.0001556218,0.00001130786],"category_scores_gemma":[0.00008727923,0.00027171857,0.0001801205,0.00048175632,0.00018826104,0.0010975901,0.0006938182,0.00025640192,0.000019863308],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012146435,0.0002607015,0.039703418,0.0005738404,0.00029018003,0.0000030859558,0.005984576,0.000007081177,0.00013339674,0.8587711,0.0066064363,0.087544754],"study_design_scores_gemma":[0.01573507,0.0015141749,0.11107689,0.0017641592,0.00034245226,0.00013772237,0.0035776075,0.12545548,0.0055718725,0.33063436,0.40041733,0.003772899],"about_ca_topic_score_codex":0.000013065469,"about_ca_topic_score_gemma":0.000014152149,"teacher_disagreement_score":0.5793844,"about_ca_system_score_codex":0.00003642027,"about_ca_system_score_gemma":0.000065902386,"threshold_uncertainty_score":0.9999735},"labels":[],"label_agreement":null},{"id":"W6910453624","doi":"10.4230/lipics.cp.2025.7","title":"Optimizing 2D Cutting: A Bin Packing Approach to Minimize Scraps and Maximize Their Reusability","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Bin packing problem; Reusability; Scrap; Leverage (statistics); Process (computing); Benchmark (surveying); Linear programming; Bin","score_opus":0.014183435343222302,"score_gpt":0.23016746625178017,"score_spread":0.21598403090855786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910453624","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04240231,0.00026246277,0.8809321,0.0005103628,0.0012059328,0.002504693,0.00041377466,0.0010774411,0.0706909],"genre_scores_gemma":[0.57324165,0.0001495427,0.42352107,0.0014479845,0.00010957936,0.0003506581,0.00041561574,0.00012852342,0.00063538103],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975209,0.00004002992,0.0011109919,0.00033308673,0.00024038862,0.00075455435],"domain_scores_gemma":[0.99854517,0.00019478453,0.00014949187,0.0006826704,0.00018462559,0.00024325783],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007467206,0.00050853717,0.0006006398,0.0004371527,0.00033437295,0.00048785258,0.00047893685,0.00027938146,0.00002226458],"category_scores_gemma":[0.00018700561,0.00047459544,0.00018562815,0.000620743,0.000099289035,0.0006367577,0.00028315987,0.0004451581,0.000020014559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073152623,0.0011574778,0.021618018,0.015274523,0.0019075172,0.0000045642323,0.113087974,0.692836,0.0009395946,0.01354169,0.043260943,0.09564019],"study_design_scores_gemma":[0.004327076,0.00008992778,0.0007288713,0.00073159335,0.00009770734,0.000026657633,0.0062201684,0.89462644,0.0016812407,0.00066122966,0.08966743,0.001141666],"about_ca_topic_score_codex":0.000007827964,"about_ca_topic_score_gemma":0.0000033717495,"teacher_disagreement_score":0.5308393,"about_ca_system_score_codex":0.0001290691,"about_ca_system_score_gemma":0.00004421292,"threshold_uncertainty_score":0.9997706},"labels":[],"label_agreement":null},{"id":"W6910470447","doi":"10.4230/dagrep.12.10.106","title":"Intelligent Security: Is \"AI for Cybersecurity\" a Blessing or a Curse (Dagstuhl Seminar 22412)","year":2023,"lang":"en","type":"report","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Blessing; Curse; Czech; Work (physics); Focus group","score_opus":0.11970142247771987,"score_gpt":0.4044872200558894,"score_spread":0.2847857975781695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910470447","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07082562,0.006309398,0.048285596,0.0051802937,0.082170166,0.11056876,0.55780333,0.020379016,0.098477796],"genre_scores_gemma":[0.20027733,0.02840031,0.062188134,0.025730686,0.039554846,0.0565254,0.31968972,0.032442946,0.23519064],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9764566,0.00023656791,0.009011482,0.0025196455,0.006005409,0.00577032],"domain_scores_gemma":[0.9790799,0.0016381289,0.006592416,0.0046171662,0.00634295,0.0017294325],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","research_integrity"],"category_scores_codex":[0.00735012,0.0045079147,0.005691497,0.0039311247,0.0019603192,0.0028258201,0.0041971873,0.0039342665,0.0006962084],"category_scores_gemma":[0.0035638672,0.004157193,0.0041130343,0.0029335404,0.001133541,0.0035732207,0.0025961234,0.004650807,0.0065968684],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":true,"study_design_scores_codex":[0.0023477597,0.0017469446,0.00076392276,0.024725169,0.004382279,0.00021281803,0.05077124,0.00006462046,0.000031041513,0.0005914494,0.9031853,0.011177421],"study_design_scores_gemma":[0.006651263,0.0012176178,0.00002959062,0.008556403,0.0025120915,0.0010313396,0.011735348,0.020220758,0.0011618189,0.0020250813,0.9400103,0.0048483987],"about_ca_topic_score_codex":0.0005104698,"about_ca_topic_score_gemma":0.0010986287,"teacher_disagreement_score":0.23811364,"about_ca_system_score_codex":0.00519507,"about_ca_system_score_gemma":0.006101788,"threshold_uncertainty_score":0.9995327},"labels":[],"label_agreement":null},{"id":"W6910493891","doi":"10.4230/lipics.cpm.2021.15","title":"Data Structures for Categorical Path Counting Queries","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Categorical variable; Path (computing); Range query (database); Tree (set theory); Data structure; Range (aeronautics); Tree structure; Matrix (chemical analysis)","score_opus":0.03914755067280152,"score_gpt":0.2941442570978527,"score_spread":0.2549967064250512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910493891","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005625027,0.00019199456,0.9871271,0.00045253773,0.0016481456,0.0006293294,0.0034723224,0.00021901214,0.000634487],"genre_scores_gemma":[0.17395198,0.000121326724,0.8083318,0.0025112291,0.0008594422,0.0001714857,0.013543611,0.00008002535,0.00042914017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99725515,0.00003207799,0.0009191504,0.00052450027,0.00053150934,0.00073763786],"domain_scores_gemma":[0.9965469,0.00026049805,0.00037598258,0.0021413984,0.00048350435,0.00019166998],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000532137,0.00035466516,0.00044263367,0.00010348221,0.0006075731,0.0010920665,0.0025535948,0.00019187294,0.000021608937],"category_scores_gemma":[0.00029653896,0.00029868455,0.00014946065,0.00029529905,0.00008149857,0.0037401395,0.0024978698,0.00030176455,0.00002412236],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021707412,0.0007580242,0.0037809638,0.0025293361,0.00052853714,0.00007967753,0.010772221,0.00035054816,0.00046666726,0.5549714,0.23603578,0.1895098],"study_design_scores_gemma":[0.001742684,0.00011200756,0.0004740163,0.00007153949,0.000032313637,0.00013232924,0.00073658,0.41177815,0.00092911994,0.008097453,0.5753491,0.0005446976],"about_ca_topic_score_codex":0.000020895845,"about_ca_topic_score_gemma":0.00002070149,"teacher_disagreement_score":0.5468739,"about_ca_system_score_codex":0.00006976259,"about_ca_system_score_gemma":0.00025003566,"threshold_uncertainty_score":0.99994653},"labels":[],"label_agreement":null},{"id":"W6910493941","doi":"10.4230/lipics.disc.2022.11","title":"How to Meet at a Node of Any Connected Graph","year":2022,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Rendezvous; Strongly connected component; Graph; Node (physics); Set (abstract data type); Task (project management); Finite set; Directed graph; Integer (computer science)","score_opus":0.017399656834605638,"score_gpt":0.2415029935148019,"score_spread":0.22410333668019625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910493941","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09446351,0.00004536571,0.887173,0.006294584,0.0011791816,0.0027092653,0.0012284695,0.0004399406,0.006466658],"genre_scores_gemma":[0.8705347,0.000016162337,0.122375995,0.004278485,0.00004767824,0.0004991098,0.00034508173,0.000049709317,0.0018530859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99739116,0.00008387858,0.00075055665,0.00028630692,0.00081277336,0.0006753378],"domain_scores_gemma":[0.99796987,0.00012594179,0.00036713513,0.0008715043,0.00037309885,0.0002924507],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066465384,0.00026313856,0.00038919805,0.0004967715,0.00056034786,0.00031759604,0.0016596225,0.00007511114,0.00009060414],"category_scores_gemma":[0.0001276754,0.0002552745,0.00020982636,0.0010482704,0.00007235031,0.0010637158,0.0017194782,0.00018691989,0.000019670046],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00093854446,0.0026145985,0.015686672,0.002305142,0.0010118934,0.00003984571,0.13059606,0.07719415,0.0041538295,0.43933657,0.31198877,0.0141339125],"study_design_scores_gemma":[0.0064712316,0.0015112051,0.0004899394,0.000093101924,0.00003278436,0.000112483714,0.0031254767,0.55158794,0.0045698755,0.0023923186,0.42847008,0.0011435857],"about_ca_topic_score_codex":0.000010345163,"about_ca_topic_score_gemma":0.000025453517,"teacher_disagreement_score":0.7760712,"about_ca_system_score_codex":0.0001704274,"about_ca_system_score_gemma":0.00009696448,"threshold_uncertainty_score":0.9999899},"labels":[],"label_agreement":null},{"id":"W6910514991","doi":"10.4230/lipics.gd.2024.27","title":"On k-Planar Graphs Without Short Cycles","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University","funders":"Austrian Science Fund","keywords":"Upper and lower bounds; Constant (computer programming); Graph; Crossing number (knot theory); Plane (geometry); Enhanced Data Rates for GSM Evolution","score_opus":0.01657954039253932,"score_gpt":0.2767311172570973,"score_spread":0.260151576864558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910514991","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13363867,0.00015946239,0.85285866,0.0006989647,0.0026245876,0.00077022915,0.00020805173,0.00065028126,0.008391075],"genre_scores_gemma":[0.9654618,0.000033857268,0.031792026,0.0014100552,0.00020622114,0.00009488468,0.0004492619,0.000030040614,0.00052184355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979121,0.000028594382,0.0006711895,0.0003416685,0.000570563,0.00047584713],"domain_scores_gemma":[0.9988518,0.00021036323,0.00008508096,0.0005257364,0.00015466445,0.0001723829],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047452908,0.00031273204,0.0002644955,0.0005386944,0.00029339865,0.00087533897,0.0007603589,0.00013694455,0.000020705435],"category_scores_gemma":[0.000045916255,0.00027111822,0.00022460237,0.0006259859,0.000053424865,0.0015748189,0.00013443278,0.00030512857,0.0003127693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000688099,0.00025737917,0.0010033508,0.0005509314,0.00026167225,0.000022275226,0.0047549275,0.0037966126,0.00020396335,0.8341288,0.030446313,0.12450495],"study_design_scores_gemma":[0.0010095728,0.00054252177,0.0012838829,0.00034361225,0.00004555444,0.00015765805,0.00018169692,0.77889735,0.0024361042,0.043986276,0.17026274,0.00085302326],"about_ca_topic_score_codex":0.0000040531527,"about_ca_topic_score_gemma":0.000007011763,"teacher_disagreement_score":0.83182317,"about_ca_system_score_codex":0.00008367802,"about_ca_system_score_gemma":0.00010086189,"threshold_uncertainty_score":0.9999741},"labels":[],"label_agreement":null},{"id":"W6910549475","doi":"10.4230/lipics.isaac.2022.8","title":"Bi-Criteria Approximation Algorithms for Bounded-Degree Subset TSP","year":2022,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Travelling salesman problem; Approximation algorithm; Vertex (graph theory); Degree (music); Steiner tree problem; Multiset; Vertex cover; Graph; Spanning tree","score_opus":0.04451651043492749,"score_gpt":0.29754264998369145,"score_spread":0.25302613954876396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910549475","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04448785,0.00007671415,0.9419662,0.00018096506,0.002668246,0.0026117056,0.0039434703,0.001047038,0.0030178272],"genre_scores_gemma":[0.20192818,0.000035696925,0.78590804,0.0007578577,0.0004968718,0.0023746402,0.007611353,0.00033549996,0.00055183267],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99698424,0.000075270575,0.0012818979,0.00026892105,0.0005348826,0.00085480406],"domain_scores_gemma":[0.9984296,0.00021688569,0.00030409102,0.00063203817,0.00023724209,0.00018016268],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014550877,0.0004545943,0.00051046436,0.00039196722,0.0007555173,0.00035001273,0.00067129487,0.00018491887,0.00018982044],"category_scores_gemma":[0.0001505974,0.00050923484,0.00028667916,0.0004981755,0.00006603038,0.00095140806,0.00025054172,0.00047333987,0.00003465239],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00088177086,0.0012378335,0.0034621102,0.009276251,0.0017077238,0.000013052359,0.051307395,0.5796323,0.0021384205,0.018499509,0.123226635,0.20861702],"study_design_scores_gemma":[0.0026363116,0.00018161998,0.000117005526,0.000033517088,0.00005465015,0.000045739795,0.0013536524,0.87959886,0.0010212964,0.0007741625,0.11360444,0.00057875784],"about_ca_topic_score_codex":0.0000062010195,"about_ca_topic_score_gemma":0.000003603141,"teacher_disagreement_score":0.29996654,"about_ca_system_score_codex":0.0004208795,"about_ca_system_score_gemma":0.00006060274,"threshold_uncertainty_score":0.99973595},"labels":[],"label_agreement":null},{"id":"W6910552698","doi":"10.4230/lipics.ecoop.2022.0","title":"Front Matter, Table of Contents, Preface, Conference Organization","year":2022,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Diverse Scientific and Economic Studies","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Table (database); Front (military); Table of contents; Front office; Front and back ends","score_opus":0.030068373311759634,"score_gpt":0.19713671650612644,"score_spread":0.1670683431943668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910552698","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3854531,0.0007309813,0.020303369,0.00061324844,0.010178852,0.002875709,0.039931767,0.00019086078,0.5397221],"genre_scores_gemma":[0.91549015,0.00007866896,0.0012104046,0.00064754084,0.000043683434,0.00012125756,0.0008092682,0.000041450323,0.08155755],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99796027,0.000010240734,0.001233568,0.0002777959,0.000093799266,0.0004243106],"domain_scores_gemma":[0.99839294,0.00003249209,0.00090334425,0.00042648255,0.00016319937,0.00008153509],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005195489,0.00021054644,0.00055957487,0.00025091387,0.0004294003,0.00013377145,0.00055948534,0.0000668297,0.022741327],"category_scores_gemma":[0.000068025976,0.00024387804,0.0001245983,0.00024043497,0.00011597677,0.00068238494,0.00051539653,0.0001722369,0.005282938],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011118334,0.00060266315,0.19768463,0.0004885951,0.00049603876,0.0000011472549,0.016240645,0.00087667204,0.000037657835,0.07922479,0.7039046,0.0003313589],"study_design_scores_gemma":[0.0035066083,0.00018562972,0.005862456,0.000034450128,0.00003205209,0.000011566722,0.010898117,0.008162922,0.0003129853,0.002014261,0.9683458,0.0006331605],"about_ca_topic_score_codex":0.000097420336,"about_ca_topic_score_gemma":0.000005345097,"teacher_disagreement_score":0.53003705,"about_ca_system_score_codex":0.00018582663,"about_ca_system_score_gemma":0.00003046417,"threshold_uncertainty_score":0.99549156},"labels":[],"label_agreement":null},{"id":"W6910679111","doi":"10.4230/oasics.manzini","title":"OASIcs, Volume 131, Manzini's Festschrift, Complete Volume","year":2025,"lang":"en","type":"other","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Phonetics and Phonology Research","field":"Psychology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Volume (thermodynamics); Work (physics); Compression (physics); Ventricular volume","score_opus":0.02694934749136053,"score_gpt":0.3227305470015886,"score_spread":0.2957811995102281,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910679111","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007129193,0.0010140239,0.006713435,0.000891572,0.008069912,0.0033074708,0.016036168,0.00069105113,0.96256346],"genre_scores_gemma":[0.0042357026,0.00030174904,0.002571033,0.0019711256,0.0010962579,0.0005956856,0.0057336595,0.00080964965,0.98268515],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99428886,0.00018702955,0.0018007117,0.00085150334,0.0007374501,0.0021344596],"domain_scores_gemma":[0.99550915,0.00021061153,0.0009902077,0.0024407445,0.00036999388,0.00047931215],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00077126693,0.0011919374,0.0016264437,0.0013336252,0.00037937806,0.00034225883,0.0023246286,0.002064623,0.017686484],"category_scores_gemma":[0.00012889369,0.0012035501,0.0007006287,0.0005308392,0.0006771618,0.00021162,0.00091028534,0.0021345234,0.015226002],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021748188,0.0004525651,0.0034669156,0.00096313184,0.001359894,0.00003714673,0.0032270278,0.000002587086,0.000005319297,0.0054072803,0.9786823,0.0061783507],"study_design_scores_gemma":[0.003843496,0.00039915094,0.002779398,0.00044386354,0.00017039635,0.00006549494,0.0005667225,0.0009433268,0.0000076791885,0.0005504534,0.9891103,0.0011197472],"about_ca_topic_score_codex":0.0010011519,"about_ca_topic_score_gemma":0.00038423107,"teacher_disagreement_score":0.02012169,"about_ca_system_score_codex":0.0001582843,"about_ca_system_score_gemma":0.0003441955,"threshold_uncertainty_score":0.9992309},"labels":[],"label_agreement":null},{"id":"W6910774580","doi":"10.4230/lipics.sea.2025.0","title":"Front Matter, Table of Contents, Preface, Conference Organization","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Diverse Scientific and Economic Studies","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Leibniz-Gemeinschaft; Univerzita Karlova v Praze; Centre National de la Recherche Scientifique; Universitat Politècnica de Catalunya; Gran Sasso Science Institute; Sandia National Laboratories; Università degli Studi dell'Aquila; Universität Stuttgart; Universidad de Chile; Universität Konstanz; Rheinische Friedrich-Wilhelms-Universität Bonn; Universität Salzburg; Danmarks Tekniske Universitet; Universität Hamburg; University of Ioannina; Technische Universität Dortmund; Università di Catania; Stony Brook University; University of Waterloo; University of Patras; Institut national de recherche en informatique et en automatique (INRIA); Helsingin Yliopisto; TU Graz, Internationale Beziehungen und Mobilitätsprogramme; Universität Osnabrück; Université de Genève","keywords":"Table (database); Front (military); Table of contents; Front office; Front and back ends","score_opus":0.02358150356367914,"score_gpt":0.20934650921269696,"score_spread":0.18576500564901782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910774580","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12796347,0.00059976947,0.050850704,0.0005265355,0.0063622613,0.0017599084,0.009234457,0.00012318468,0.8025797],"genre_scores_gemma":[0.8216227,0.00020157889,0.0021334016,0.0008867377,0.000040248407,0.000060961396,0.00046678152,0.00003067046,0.17455687],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99797803,0.0000058306373,0.0012942086,0.00027004504,0.000053624008,0.00039823493],"domain_scores_gemma":[0.9985236,0.00004020781,0.0006711831,0.000440893,0.00025798552,0.00006611052],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00037401222,0.00022109228,0.00060801936,0.00030800336,0.00020428344,0.00018038535,0.00046963492,0.00013115538,0.0049838126],"category_scores_gemma":[0.00012265833,0.00023885808,0.00011954679,0.0002676833,0.00015029672,0.0007389924,0.00026092588,0.00012067951,0.0064299502],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069333364,0.00034135257,0.23037113,0.0008393615,0.0005449013,3.8972726e-7,0.0053862846,0.000121189165,0.000030500889,0.16389242,0.59793705,0.00046608408],"study_design_scores_gemma":[0.005038323,0.00010289604,0.018453043,0.00026081403,0.00006377734,0.0000033340887,0.0058119087,0.0083378805,0.0013565553,0.0058465097,0.9539783,0.0007466624],"about_ca_topic_score_codex":0.000086005544,"about_ca_topic_score_gemma":0.000010216755,"teacher_disagreement_score":0.6936593,"about_ca_system_score_codex":0.0001215861,"about_ca_system_score_gemma":0.000035972862,"threshold_uncertainty_score":0.9959258},"labels":[],"label_agreement":null},{"id":"W6928871751","doi":"10.4230/lipics.opodis.2024.6","title":"DULL: A Fast Scalable Detectable Unrolled Lock-Based Linked List","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Radioactive element chemistry and processing","field":"Chemistry","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Scalability; Correctness; Multiprocessing; Data structure; Mutual exclusion","score_opus":0.008538810778566691,"score_gpt":0.2544704868382914,"score_spread":0.24593167605972469,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6928871751","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6852329,0.0003859556,0.040355485,0.0010073145,0.0009875483,0.0013775743,0.001570261,0.0010205504,0.2680624],"genre_scores_gemma":[0.9772676,0.000021696958,0.0046465,0.0011464529,0.00025188044,0.00033433395,0.0011676266,0.00007914925,0.015084712],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9965466,0.000021196007,0.0013746729,0.00045131106,0.0004962874,0.0011098966],"domain_scores_gemma":[0.99766505,0.00023722267,0.0005587229,0.0008775348,0.0004089788,0.0002524813],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00045667958,0.0006457883,0.00073071267,0.00022114317,0.0008172673,0.00056269864,0.0008880341,0.0004906416,0.001010434],"category_scores_gemma":[0.00025087513,0.0005732187,0.00039645625,0.0005613049,0.00020035986,0.00083442486,0.00020767699,0.0007821422,0.00006834366],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0144657465,0.008583652,0.14779384,0.09178487,0.0058403173,0.00013183308,0.014625069,0.0069332807,0.32906276,0.0026127482,0.112373,0.2657929],"study_design_scores_gemma":[0.012315553,0.00009441963,0.00007553595,0.0013699199,0.00024992833,0.000021226495,0.0018971458,0.07346415,0.597459,0.0004966028,0.31139064,0.0011658736],"about_ca_topic_score_codex":0.000025594245,"about_ca_topic_score_gemma":0.000016421844,"teacher_disagreement_score":0.29203475,"about_ca_system_score_codex":0.00037675552,"about_ca_system_score_gemma":0.00035820366,"threshold_uncertainty_score":0.9999028},"labels":[],"label_agreement":null},{"id":"W6928957407","doi":"10.4230/lipics.ecrts.2024","title":"LIPIcs, Volume 298, ECRTS 2024, Complete Volume","year":2024,"lang":"en","type":"other","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Genetics, Aging, and Longevity in Model Organisms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"","score_opus":0.01134675045352374,"score_gpt":0.23875018745689516,"score_spread":0.22740343700337143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6928957407","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005381425,0.009478169,0.07560121,0.0011861636,0.024281312,0.006814597,0.02503023,0.0010984464,0.85112846],"genre_scores_gemma":[0.009214073,0.0008158609,0.007425768,0.0016381931,0.0031787225,0.00016870293,0.008390859,0.0013948979,0.9677729],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99617773,0.00005227511,0.0012283764,0.00080768764,0.00057097356,0.0011629249],"domain_scores_gemma":[0.99713176,0.0000115604125,0.00062216603,0.0016293769,0.00022838303,0.00037676693],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00037174916,0.0010830867,0.0009258154,0.00039851037,0.00017687242,0.00042549046,0.0011780247,0.001356915,0.0012840377],"category_scores_gemma":[0.00007381616,0.0010919091,0.0006674826,0.00017276168,0.00033062932,0.00002334625,0.0008160531,0.0007553604,0.003984282],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000425598,0.00014154096,0.0006199622,0.0018146733,0.0005908252,0.000008920432,0.00092418125,0.00003989277,0.00043081524,0.00011475842,0.99383676,0.0014350842],"study_design_scores_gemma":[0.0011715268,0.00040882084,0.000051200062,0.00029458446,0.00026441403,0.000066665176,0.0002804647,0.0022110576,0.0005116931,0.0001449282,0.9933458,0.0012488735],"about_ca_topic_score_codex":0.00008137736,"about_ca_topic_score_gemma":0.00024620237,"teacher_disagreement_score":0.11664448,"about_ca_system_score_codex":0.00008982249,"about_ca_system_score_gemma":0.00017692111,"threshold_uncertainty_score":0.99993956},"labels":[],"label_agreement":null},{"id":"W6929000334","doi":"10.4230/lipics.cp.2023.23","title":"Large Neighborhood Beam Search for Domain-Independent Dynamic Programming","year":2023,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Benchmark (surveying); Solver; Scheduling (production processes); State space; Beam search; Constraint programming; Dynamic programming; State (computer science); Search algorithm","score_opus":0.013371875105233005,"score_gpt":0.27542852147713176,"score_spread":0.26205664637189874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6929000334","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028562238,0.0000114282075,0.9650773,0.00091859925,0.001075721,0.0022750082,0.0003868906,0.00078258093,0.0009102509],"genre_scores_gemma":[0.8982915,0.000038098016,0.09822069,0.00072320306,0.000119196215,0.00059962086,0.0013681375,0.000067363086,0.0005721296],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99694574,0.000030819858,0.00089329097,0.00038346415,0.0006237067,0.001122971],"domain_scores_gemma":[0.9982499,0.00018519133,0.0002673493,0.0006854924,0.00036102248,0.00025102953],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010640013,0.00034144003,0.00034687106,0.0005091673,0.00065431214,0.0007218373,0.00092816626,0.00021329412,0.000030104153],"category_scores_gemma":[0.00006231408,0.000331841,0.0002964964,0.00081528974,0.00006478376,0.0015711116,0.0004583039,0.00031712864,0.00021577085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003318348,0.0012861494,0.02588399,0.0027661747,0.0008586472,0.000034297478,0.06647747,0.0086395955,0.00034911867,0.33996913,0.008375998,0.5450276],"study_design_scores_gemma":[0.0057791695,0.000371401,0.0032063967,0.00011136414,0.000029775,0.00006261163,0.0045609027,0.90956414,0.000423361,0.0021734438,0.072938085,0.0007793785],"about_ca_topic_score_codex":0.0000036632628,"about_ca_topic_score_gemma":0.000033465953,"teacher_disagreement_score":0.9009245,"about_ca_system_score_codex":0.00019785111,"about_ca_system_score_gemma":0.00016125686,"threshold_uncertainty_score":0.99991333},"labels":[],"label_agreement":null},{"id":"W6929005788","doi":"10.4230/lipics.cpm.2024.17","title":"Closing the Gap: Minimum Space Optimal Time Distance Labeling Scheme for Interval Graphs","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Genomic variations and chromosomal abnormalities","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vertex (graph theory); Constant (computer programming); Upper and lower bounds; Interval (graph theory); Interval graph; Graph; Omega; Edge-graceful labeling","score_opus":0.010819448760542229,"score_gpt":0.24823209171967836,"score_spread":0.23741264295913614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6929005788","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89621097,0.0012969676,0.093756974,0.001134594,0.0013043833,0.001496122,0.002410698,0.00011974797,0.0022695703],"genre_scores_gemma":[0.97470015,0.000089320165,0.01916572,0.000500173,0.0004961696,0.00024401877,0.0016628196,0.00007540482,0.003066202],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99830794,0.000023690884,0.0006523451,0.00027742956,0.00017907437,0.0005594931],"domain_scores_gemma":[0.9990435,0.00007399652,0.00016230813,0.000446437,0.00018129018,0.00009245131],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004364709,0.00032032412,0.00025184356,0.00008004781,0.00038569525,0.0004177508,0.00045780092,0.00019547733,0.0000284992],"category_scores_gemma":[0.000069072084,0.00024818518,0.00036048444,0.00013188116,0.00013291676,0.00006156225,0.00021879078,0.00020013186,0.000050035473],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004574588,0.0017626967,0.009227495,0.014306142,0.008573365,0.000035234225,0.062978506,0.0053487765,0.32168946,0.25953442,0.28673136,0.025237948],"study_design_scores_gemma":[0.002582647,0.00080645835,0.00008111566,0.00045994305,0.0002108028,0.00013597579,0.0044457735,0.09541582,0.04264835,0.0014087885,0.85073316,0.0010711759],"about_ca_topic_score_codex":0.00000562687,"about_ca_topic_score_gemma":0.000009246646,"teacher_disagreement_score":0.5640018,"about_ca_system_score_codex":0.00004861426,"about_ca_system_score_gemma":0.00009823141,"threshold_uncertainty_score":0.999997},"labels":[],"label_agreement":null},{"id":"W6929073864","doi":"10.4230/lipics.ecrts.2025.9","title":"DAMA: A Dual Arbitration Mechanism for Mixed-Criticality Applications","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Latency (audio); Arbitration; Scheduling (production processes); Upper and lower bounds; Overhead (engineering); Preemption; Processor scheduling","score_opus":0.012993861564221025,"score_gpt":0.2810580026251762,"score_spread":0.2680641410609552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6929073864","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064951032,0.000025008545,0.98013914,0.0013891141,0.0011045772,0.0035484752,0.0002877023,0.00039995697,0.006610927],"genre_scores_gemma":[0.6725411,0.00000883304,0.32071507,0.0022974475,0.00027274553,0.0032495772,0.00039128886,0.000040133473,0.00048382042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966685,0.00006027393,0.001522426,0.00047993194,0.0004671298,0.0008017054],"domain_scores_gemma":[0.9968705,0.0004473734,0.00037949238,0.0012779128,0.0008188105,0.00020590192],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011808176,0.00039282165,0.0005098599,0.00032446143,0.0006390271,0.0009163471,0.0012274509,0.00029529782,0.0000048602033],"category_scores_gemma":[0.00027541176,0.00038608987,0.0003280544,0.00057775417,0.00008979224,0.0021514283,0.0003967002,0.00032079333,0.000094756855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023603654,0.00020554903,0.00010317707,0.00086134236,0.00010987568,7.41389e-7,0.0009998471,0.00005444651,0.0004095929,0.990284,0.0020330288,0.0049147527],"study_design_scores_gemma":[0.005378291,0.00033805825,0.00042884483,0.00042411027,0.00016674605,0.00007790561,0.0017684442,0.6962191,0.016381856,0.20190848,0.07564669,0.0012614881],"about_ca_topic_score_codex":0.000021938058,"about_ca_topic_score_gemma":0.000022979502,"teacher_disagreement_score":0.78837556,"about_ca_system_score_codex":0.00020346233,"about_ca_system_score_gemma":0.00025546618,"threshold_uncertainty_score":0.9998591},"labels":[],"label_agreement":null},{"id":"W6929079456","doi":"10.4230/lipics.approx/random.2024.51","title":"Consequences of Randomized Reductions from SAT to Time-Bounded Kolmogorov Complexity","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Kolmogorov complexity; Randomized algorithm; Constant (computer programming); Reduction (mathematics); Time complexity; Computational complexity theory; Class (philosophy); Running time","score_opus":0.02830620384657163,"score_gpt":0.2812607922792531,"score_spread":0.2529545884326815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6929079456","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11450892,0.00044368685,0.86340183,0.00435127,0.0044615376,0.003010039,0.0026936617,0.00090370013,0.0062253326],"genre_scores_gemma":[0.5642308,0.00007514454,0.43236768,0.0011353366,0.0003742426,0.00033019687,0.0007185279,0.000052473963,0.0007156037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965396,0.00013874844,0.0016063914,0.00045034898,0.00065148977,0.0006134455],"domain_scores_gemma":[0.99715406,0.0009294173,0.00032671433,0.0009837789,0.00033870892,0.00026735078],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012015947,0.00041558614,0.0010636038,0.00052986084,0.00038368875,0.0008611758,0.0016491207,0.00016359043,0.0001660346],"category_scores_gemma":[0.0002539741,0.0003586535,0.0006770326,0.0008909397,0.00096698746,0.0015290739,0.00060850807,0.00038514743,0.0003972957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030983447,0.00062743877,0.0001487417,0.001027974,0.0018719279,0.00002243185,0.036008768,0.00029388428,0.0023045011,0.9001415,0.023485735,0.030968776],"study_design_scores_gemma":[0.036272533,0.000468739,0.00017687869,0.001250392,0.00028792612,0.00016942518,0.0012448813,0.40152746,0.014255566,0.46038282,0.08236941,0.0015939486],"about_ca_topic_score_codex":0.00021856815,"about_ca_topic_score_gemma":0.00002985791,"teacher_disagreement_score":0.44972187,"about_ca_system_score_codex":0.00011077483,"about_ca_system_score_gemma":0.00021316676,"threshold_uncertainty_score":0.9998866},"labels":[],"label_agreement":null},{"id":"W6929089696","doi":"10.4230/lipics.isaac.2024.15","title":"On the Spanning and Routing Ratios of the Yao-Four Graph","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Euclidean distance; Distance; Vertex (graph theory); Path graph; Spanner; Graph; Butterfly graph; Line graph; Euclidean geometry","score_opus":0.018773751488630048,"score_gpt":0.23073189276381517,"score_spread":0.2119581412751851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6929089696","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38343844,0.00017500005,0.5951756,0.0033869743,0.00550112,0.0015565663,0.00007181691,0.00025650248,0.010437969],"genre_scores_gemma":[0.99781895,0.0000088746465,0.0007534451,0.0008959694,0.00013807022,0.000042758587,0.0000041774147,0.000015292231,0.00032247047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837774,0.00006652932,0.0006931003,0.00018211106,0.00034428228,0.0003362384],"domain_scores_gemma":[0.99855995,0.00045210277,0.00023633741,0.00057772524,0.00012053627,0.000053342243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009834248,0.00020269354,0.00021748114,0.00011834819,0.00043374786,0.0006905855,0.00080164045,0.00009203533,0.000008419293],"category_scores_gemma":[0.000097826516,0.00010976768,0.00020715536,0.0003892479,0.000086353415,0.0006939644,0.00031294549,0.00035029557,0.000019098734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020714762,0.000044170007,0.0015357451,0.00045227207,0.00020109148,0.000003139738,0.029702127,0.0013231288,0.000087807115,0.9433291,0.014240657,0.009060043],"study_design_scores_gemma":[0.000554567,0.00018341382,0.0005842075,0.0011104804,0.000025425592,0.00012091622,0.0021723781,0.9634855,0.00087142095,0.006287847,0.024293952,0.0003099208],"about_ca_topic_score_codex":0.000014816072,"about_ca_topic_score_gemma":0.0000112234475,"teacher_disagreement_score":0.9621623,"about_ca_system_score_codex":0.000037833404,"about_ca_system_score_gemma":0.00004115537,"threshold_uncertainty_score":0.6659332},"labels":[],"label_agreement":null},{"id":"W6929096184","doi":"10.4230/lipics.approx/random.2022","title":"LIPIcs, Volume 245, APPROX/RANDOM 2022, Complete Volume","year":2022,"lang":"en","type":"other","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Psychometric Methodologies and Testing","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Volume (thermodynamics); Work (physics); Compression (physics); Ventricular volume","score_opus":0.19952734369764433,"score_gpt":0.3852000474209052,"score_spread":0.18567270372326086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6929096184","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000749609,0.0015208579,0.11473107,0.00072655175,0.014257541,0.0045289816,0.0126563,0.0011265577,0.84970254],"genre_scores_gemma":[0.0011342274,0.00025408593,0.066708386,0.0021707588,0.0018633954,0.0005992741,0.0029940791,0.0009018099,0.923374],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.98882836,0.000603556,0.0038255074,0.0012003465,0.0038045612,0.0017376893],"domain_scores_gemma":[0.9860359,0.005941126,0.00375422,0.0032039941,0.0005330921,0.00053165655],"candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.008969307,0.0011816042,0.0024389925,0.0029031814,0.00084446836,0.0012558078,0.005186393,0.00086981436,0.03541953],"category_scores_gemma":[0.020782273,0.0009722991,0.0011678721,0.002919338,0.00044300235,0.00066955725,0.0021535202,0.001780624,0.0028594087],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013411503,0.00018302846,0.011370408,0.00029996864,0.0002367813,0.00001073068,0.0009730448,0.000049399572,0.0000018236093,0.0004526727,0.9508229,0.03546515],"study_design_scores_gemma":[0.0038750742,0.00032293287,0.00061374897,0.000111018926,0.00009774118,0.00006897487,0.0024850592,0.015377594,0.0000015028834,0.0018976491,0.97403985,0.0011088304],"about_ca_topic_score_codex":0.00015209444,"about_ca_topic_score_gemma":0.000055658158,"teacher_disagreement_score":0.07367145,"about_ca_system_score_codex":0.0002920172,"about_ca_system_score_gemma":0.00021517345,"threshold_uncertainty_score":0.999781},"labels":[],"label_agreement":null},{"id":"W6929118331","doi":"10.4230/lipics.ccc.2023.12","title":"Improved Learning from Kolmogorov Complexity","year":2023,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Genetic Mapping and Diversity in Plants and Animals","field":"Biochemistry, Genetics and Molecular Biology","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Kolmogorov complexity; Boolean function; String (physics); Probably approximately correct learning; Function (biology); Circuit complexity; Relaxation (psychology); Boolean circuit","score_opus":0.031175317303962457,"score_gpt":0.2518167329530661,"score_spread":0.22064141564910367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6929118331","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98795724,0.000053127165,0.0053887577,0.00017976557,0.00052652735,0.00040715333,0.0011830587,0.0001393132,0.004165056],"genre_scores_gemma":[0.9875488,0.00014342183,0.002295505,0.0005596486,0.0003122122,0.000026478061,0.0067756944,0.00002828478,0.0023099005],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99854493,0.000028694754,0.00044106453,0.0002594473,0.0001910395,0.00053480396],"domain_scores_gemma":[0.9991519,0.000035656813,0.00019084141,0.0003381085,0.00012683238,0.00015670276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027313663,0.00025640856,0.0002627444,0.0000902407,0.0003860906,0.00013626774,0.0003844789,0.00022894348,0.00006742474],"category_scores_gemma":[0.00010733964,0.00024288252,0.00020017951,0.00012690475,0.00010372931,0.000018287845,0.00034867457,0.00020558677,0.00019566825],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002468328,0.0011958643,0.19384421,0.0018099152,0.0028349536,0.000040717212,0.01741754,0.003367658,0.369919,0.002966853,0.3574808,0.046654135],"study_design_scores_gemma":[0.005497289,0.0010354447,0.01514244,0.0001160511,0.00010408754,0.000024804236,0.006528957,0.046765123,0.02422644,0.00073821784,0.8985761,0.0012450394],"about_ca_topic_score_codex":0.0000703774,"about_ca_topic_score_gemma":0.000025733863,"teacher_disagreement_score":0.5410953,"about_ca_system_score_codex":0.000014428103,"about_ca_system_score_gemma":0.000040933748,"threshold_uncertainty_score":0.9904462},"labels":[],"label_agreement":null},{"id":"W6929138079","doi":"10.4230/lipics.giscience.2023.9","title":"Platial k-Anonymity: Improving Location Anonymity Through Temporal Popularity Signatures","year":2023,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Statistical Methods and Bayesian Inference","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Anonymity; Popularity; Set (abstract data type); Location data; Field (mathematics); Spatial analysis; Location-based service; k-anonymity","score_opus":0.06392384411763485,"score_gpt":0.3668328807835996,"score_spread":0.30290903666596475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6929138079","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06388635,0.000020884248,0.9287139,0.00028445668,0.0011155511,0.0016900912,0.0013062379,0.0006594784,0.0023230275],"genre_scores_gemma":[0.4976548,0.000012242678,0.5000363,0.00049387175,0.0003514049,0.0001744328,0.0009993326,0.000084657026,0.00019300162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996014,0.00014998557,0.0015769381,0.00042829555,0.0007885273,0.0010422786],"domain_scores_gemma":[0.9964468,0.0013363532,0.00069464167,0.0008171282,0.00046941618,0.00023565203],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015309695,0.00056227256,0.0007905671,0.00024671367,0.0006144238,0.0003810788,0.0006733328,0.00052116683,0.00011686343],"category_scores_gemma":[0.0030692318,0.0004958944,0.0002868975,0.00078933535,0.00021790845,0.0012081161,0.00037768655,0.00080684747,0.00014853347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061120966,0.0008123369,0.012919507,0.0060537443,0.00042043376,0.000055296823,0.008735964,0.000050300478,0.00039420387,0.86594474,0.033612907,0.07038935],"study_design_scores_gemma":[0.00421601,0.0004975805,0.004797569,0.00036935214,0.00023733104,0.000040225972,0.0019879106,0.08169615,0.0020421292,0.89233065,0.010321517,0.0014635541],"about_ca_topic_score_codex":0.00017142693,"about_ca_topic_score_gemma":0.000096782336,"teacher_disagreement_score":0.43376842,"about_ca_system_score_codex":0.00016995316,"about_ca_system_score_gemma":0.00016896223,"threshold_uncertainty_score":0.99974924},"labels":[],"label_agreement":null},{"id":"W6929198917","doi":"10.4230/lipics.cp.2025.23","title":"RPID: Rust Programmable Interface for Domain-Independent Dynamic Programming","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Alliance de recherche numérique du Canada; University of Toronto; Innovation, Science and Economic Development Canada","keywords":"Solver; Flexibility (engineering); Rust (programming language); Interface (matter); Software; Set (abstract data type); Dynamic programming; Class (philosophy)","score_opus":0.012899159785055066,"score_gpt":0.31897544518650495,"score_spread":0.3060762854014499,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6929198917","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011742669,0.00010616704,0.9779131,0.0005816869,0.0022651758,0.0046161124,0.000115730014,0.0006142135,0.0020451888],"genre_scores_gemma":[0.09267607,0.000016785743,0.90380937,0.00048349987,0.00005967193,0.0016792095,0.00018640845,0.000047315694,0.0010416701],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99594176,0.000076939185,0.001562964,0.00057690067,0.0005517898,0.0012896509],"domain_scores_gemma":[0.9969054,0.00020467768,0.0006574906,0.001493551,0.0005280859,0.00021082266],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002023639,0.0005416048,0.00058014644,0.000501389,0.0006435471,0.001183315,0.0025411164,0.00034569504,0.000006948847],"category_scores_gemma":[0.00025826695,0.0005140711,0.00037846368,0.00081149576,0.00016899557,0.002444568,0.00081887824,0.0005014469,0.00006135083],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037261812,0.0008976244,0.0010944156,0.0030740448,0.00045935655,0.000003101731,0.009413883,0.00047715948,0.0003058534,0.31996632,0.0028748398,0.6610608],"study_design_scores_gemma":[0.004294051,0.00063897105,0.00033220678,0.00042389435,0.00007162539,0.00004447675,0.0019977668,0.34080648,0.0044267396,0.008690617,0.63735783,0.0009153425],"about_ca_topic_score_codex":0.000012678754,"about_ca_topic_score_gemma":0.000023188564,"teacher_disagreement_score":0.66014546,"about_ca_system_score_codex":0.00049779017,"about_ca_system_score_gemma":0.00021632254,"threshold_uncertainty_score":0.99985355},"labels":[],"label_agreement":null},{"id":"W6929220425","doi":"10.4230/lipics.cp.2022.34","title":"Scheduling the Equipment Maintenance of an Electric Power Transmission Network Using Constraint Programming","year":2022,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Obesity, Physical Activity, Diet","field":"Medicine","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Hydro-Québec; Polytechnique Montréal","funders":"","keywords":"Scheduling (production processes); Schedule; Electric power system; Grid; Electric power; Power grid; Power transmission; Electric power transmission; Power flow; Constraint satisfaction problem","score_opus":0.01848318716378527,"score_gpt":0.277746474083795,"score_spread":0.2592632869200097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6929220425","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9804853,0.0000849328,0.015686909,0.00028417064,0.00033405516,0.0022217897,0.00008243257,0.000101879166,0.000718483],"genre_scores_gemma":[0.97960836,0.000009000932,0.019299125,0.0005793958,0.00014780603,0.00012349836,0.00014184858,0.000054978664,0.000035994646],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968602,0.00009757981,0.0009991935,0.0002677834,0.00084054924,0.00093467825],"domain_scores_gemma":[0.9982701,0.00014450136,0.0005414306,0.00056587456,0.00023282356,0.0002452906],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010838521,0.00035398925,0.00061875937,0.00014379121,0.000696005,0.00008048461,0.00044987522,0.00010339297,0.00008535882],"category_scores_gemma":[0.000055662837,0.000264991,0.0003539583,0.00058933144,0.00018493053,0.00046339075,0.00029392162,0.0008524496,0.0000044570893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.009635761,0.08496947,0.11921734,0.012642107,0.005544268,0.00027297373,0.07854634,0.13907236,0.035577808,0.06504655,0.002688669,0.44678634],"study_design_scores_gemma":[0.013545846,0.007674425,0.010771331,0.0012455633,0.00088862074,0.000902287,0.015593596,0.8776829,0.009702787,0.003098469,0.05727371,0.0016204483],"about_ca_topic_score_codex":0.000022393553,"about_ca_topic_score_gemma":0.0000022743022,"teacher_disagreement_score":0.73861057,"about_ca_system_score_codex":0.0003354971,"about_ca_system_score_gemma":0.00020408789,"threshold_uncertainty_score":0.9999802},"labels":[],"label_agreement":null},{"id":"W6929353258","doi":"10.4230/lipics.opodis.2019.0","title":"Front Matter, Table of Contents, Preface, Conference Organization","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Heat Transfer and Numerical Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"École Polytechnique Fédérale de Lausanne; Leibniz-Gemeinschaft; National University of Singapore","keywords":"Table (database); Front (military); Table of contents; Front office; Front and back ends","score_opus":0.024545996237824778,"score_gpt":0.23569218667115555,"score_spread":0.21114619043333077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6929353258","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11433906,0.00008317326,0.8732627,0.0002807762,0.0005393016,0.00090493803,0.0007953336,0.0003413698,0.009453326],"genre_scores_gemma":[0.9816852,0.00007584317,0.016917206,0.0007356968,0.00006100254,0.000033723205,0.0003246901,0.00006876457,0.00009783618],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983308,0.000024625897,0.000856186,0.0001370923,0.00024016948,0.00041115566],"domain_scores_gemma":[0.9991662,0.000062680454,0.00007136327,0.00025026494,0.0002153211,0.00023415183],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013264574,0.00027171295,0.00048343162,0.00006859444,0.00006887728,0.00007471813,0.00034721044,0.00015708989,0.0006306388],"category_scores_gemma":[0.000089749126,0.00025461908,0.000091884365,0.0002785938,0.000057195084,0.00056841434,0.000055981036,0.00024798198,0.0003668278],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013725245,0.0019354011,0.2713332,0.040002078,0.0038066742,0.000020952057,0.15145999,0.02141628,0.14036326,0.0077379723,0.2803715,0.08018018],"study_design_scores_gemma":[0.012009017,0.0011486969,0.017221792,0.0007559157,0.00036435502,0.000038516362,0.0042707934,0.4023358,0.28493002,0.00043580047,0.27385408,0.0026351893],"about_ca_topic_score_codex":0.00001097499,"about_ca_topic_score_gemma":0.0000016565076,"teacher_disagreement_score":0.86734617,"about_ca_system_score_codex":0.00004445404,"about_ca_system_score_gemma":0.000025020128,"threshold_uncertainty_score":0.9999906},"labels":[],"label_agreement":null},{"id":"W6929452996","doi":"10.4230/darts.5.2.9","title":"Reasoning About Foreign Function Interfaces Without Modelling the Foreign Language (Artifact)","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Head and Neck Cancer Studies","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Artifact (error); Function (biology); Mathematical proof; Foreign language; Component (thermodynamics); Natural language","score_opus":0.01794237902695197,"score_gpt":0.2750068444786599,"score_spread":0.25706446545170797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6929452996","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9049236,0.0004553709,0.03148154,0.00021530043,0.00057836616,0.0020133508,0.000104014325,0.00021128218,0.060017183],"genre_scores_gemma":[0.9931375,0.00009952605,0.002756462,0.0013776409,0.00026885822,0.00016565398,0.00019276791,0.00007127385,0.0019303248],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99748105,0.000029680949,0.0009041089,0.00029008955,0.00052090664,0.0007741897],"domain_scores_gemma":[0.9983896,0.0001238943,0.00035627984,0.00070249266,0.0002560208,0.00017170329],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00061768014,0.00042678308,0.0007042053,0.00016460071,0.00039484704,0.00016487722,0.0002992291,0.00019616648,0.00015450313],"category_scores_gemma":[0.00007130266,0.0002802177,0.00028528093,0.00022009337,0.00012378991,0.00070479506,0.0001714906,0.0005635209,0.00032902876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.013071904,0.001296136,0.5444853,0.0114300335,0.0056223776,0.000038561786,0.24790768,0.017062988,0.0029975304,0.04491356,0.02842333,0.08275063],"study_design_scores_gemma":[0.016909046,0.003627083,0.006276497,0.0040179365,0.0009449508,0.0002844017,0.10789768,0.7478734,0.010053439,0.0011568319,0.09924317,0.0017155394],"about_ca_topic_score_codex":0.00006264761,"about_ca_topic_score_gemma":0.000018604487,"teacher_disagreement_score":0.73081046,"about_ca_system_score_codex":0.00016429019,"about_ca_system_score_gemma":0.000089874666,"threshold_uncertainty_score":0.999965},"labels":[],"label_agreement":null},{"id":"W6947565633","doi":"10.4230/lipics.isaac.2024.4","title":"Minimum Plane Bichromatic Spanning Trees","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Species Distribution and Climate Change","field":"Environmental Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Spanning tree; Euclidean minimum spanning tree; Minimum spanning tree; k-minimum spanning tree; Shortest-path tree; Tree (set theory); Plane (geometry); Time complexity; Regular polygon","score_opus":0.019280831635430325,"score_gpt":0.2567765929345371,"score_spread":0.23749576129910677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6947565633","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8904591,0.00018628787,0.0049104625,0.00089888345,0.0016602956,0.0009828418,0.0017426492,0.0005790901,0.098580346],"genre_scores_gemma":[0.9942892,0.0000631913,0.0007511979,0.00085240195,0.00012629076,0.00011554753,0.0013610916,0.000048293474,0.002392749],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977847,0.000018098372,0.00074293604,0.00026079695,0.0005005204,0.0006929481],"domain_scores_gemma":[0.99912494,0.00011330281,0.00013842546,0.0003897855,0.00001946799,0.00021407107],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00034985237,0.00033035892,0.00030220658,0.00011145605,0.0002647614,0.00040800628,0.0004511912,0.000166471,0.01787841],"category_scores_gemma":[0.00005554204,0.00028034215,0.00021791422,0.0003678179,0.00020822012,0.0008883146,0.0002809294,0.00025741514,0.0070235967],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002625815,0.0009767521,0.035690613,0.0031153609,0.00060208404,0.00012710331,0.0392869,0.00044889178,0.0051248423,0.015233871,0.8515007,0.04763033],"study_design_scores_gemma":[0.0016483146,0.00028761325,0.012169755,0.0003235592,0.00009819452,0.00016005855,0.010193553,0.042361572,0.0014418472,0.00036306394,0.9301,0.0008524493],"about_ca_topic_score_codex":0.000042361,"about_ca_topic_score_gemma":0.00009724326,"teacher_disagreement_score":0.1038301,"about_ca_system_score_codex":0.0004935908,"about_ca_system_score_gemma":0.000019021509,"threshold_uncertainty_score":0.9999649},"labels":[],"label_agreement":null},{"id":"W6947624803","doi":"10.4230/artifacts.24205","title":"RPID","year":2025,"lang":"en","type":"other","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Species Distribution and Climate Change","field":"Environmental Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"","score_opus":0.012479253069022847,"score_gpt":0.24834334967312657,"score_spread":0.23586409660410373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6947624803","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030900846,0.00007716252,0.0015473939,0.00025477813,0.0012773491,0.0011213508,0.0064125643,0.0003793945,0.988621],"genre_scores_gemma":[0.0016326183,0.00039928587,0.0010800984,0.003098316,0.00023929504,0.0002548079,0.005659582,0.00032604297,0.98730993],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976809,0.000020161286,0.00070355687,0.00032868594,0.0005163525,0.000750325],"domain_scores_gemma":[0.9985227,0.000040358504,0.00045113155,0.0007524384,0.000027116508,0.00020626921],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00020915177,0.0005369552,0.000525332,0.0001775616,0.00018531052,0.00016722477,0.0008123284,0.0005723717,0.17632957],"category_scores_gemma":[0.00006233037,0.00049323356,0.0003194473,0.00029073682,0.00025086995,0.00024144162,0.0005830905,0.0003753911,0.01171123],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019473813,0.00013096727,0.0014101159,0.00029319094,0.000077861565,0.0000019657937,0.0002614148,0.0000018325046,0.000005713209,0.002079927,0.9928103,0.0029072098],"study_design_scores_gemma":[0.001112807,0.000054211036,0.0005333675,0.00015255973,0.00005475161,0.000006829922,0.0008018115,0.00013436002,0.00006309613,0.00007588223,0.9964918,0.0005185549],"about_ca_topic_score_codex":0.00021786906,"about_ca_topic_score_gemma":0.00044815333,"teacher_disagreement_score":0.16461834,"about_ca_system_score_codex":0.00061061693,"about_ca_system_score_gemma":0.000033478966,"threshold_uncertainty_score":0.9997519},"labels":[],"label_agreement":null},{"id":"W6947760464","doi":"10.4230/lipics.dna.29.5","title":"Revisiting Hybridization Kinetics with Improved Elementary Step Simulation","year":2023,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Research Data Management Practices","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Kinetic energy; Set (abstract data type); Markov chain; Markov process; Work (physics); Elementary reaction; Bayesian probability; Inference; Base (topology)","score_opus":0.042819751305135434,"score_gpt":0.3280214230198652,"score_spread":0.28520167171472977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6947760464","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036054008,0.00001265967,0.9583857,0.0010752495,0.00027342752,0.0016648164,0.00018716915,0.000542547,0.0018044412],"genre_scores_gemma":[0.8180572,0.00023317315,0.17505309,0.0012578997,0.00033846727,0.0002468426,0.0038353326,0.00008575701,0.0008922506],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969061,0.000078221405,0.00091814017,0.00040131278,0.00087759,0.0008186315],"domain_scores_gemma":[0.9972746,0.000415963,0.0006130915,0.0011298893,0.00039646542,0.00017002548],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.001449714,0.00030861734,0.00027606924,0.0005109008,0.00037057215,0.0027379643,0.0017400552,0.00007712792,0.000012419625],"category_scores_gemma":[0.00038366357,0.00027176214,0.000087217464,0.0012237089,0.000058659836,0.024095785,0.0011323247,0.00028870095,0.00012619265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011867237,0.001368294,0.030627435,0.009617227,0.002247209,0.00016953023,0.012755948,0.15855259,0.0040826537,0.15212934,0.024286872,0.6029762],"study_design_scores_gemma":[0.0016153217,0.00030773578,0.0013554702,0.000117259915,0.000029926174,0.000007151301,0.00060181256,0.905622,0.00066815305,0.000114383234,0.08920116,0.0003595951],"about_ca_topic_score_codex":0.00001892108,"about_ca_topic_score_gemma":0.000012435452,"teacher_disagreement_score":0.7833326,"about_ca_system_score_codex":0.00013946161,"about_ca_system_score_gemma":0.000058228194,"threshold_uncertainty_score":0.9999735},"labels":[],"label_agreement":null},{"id":"W6947827468","doi":"10.4230/lipics.swat.2024.21","title":"Approximating Minimum Sum Coloring with Bundles","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Evolution and Paleontology Studies","field":"Earth and Planetary Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Disjoint sets; Graph coloring; Fractional coloring; Brooks' theorem; Chromatic scale; Bounded function; Graph; Edge coloring; Bundle","score_opus":0.01857988483805908,"score_gpt":0.23693530709057006,"score_spread":0.21835542225251098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6947827468","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86113656,0.0021709409,0.011848856,0.00091797154,0.0023563518,0.0013071174,0.0011413905,0.0006833345,0.118437506],"genre_scores_gemma":[0.9884805,0.00007571245,0.0094846,0.0004366258,0.00020934036,0.00002545201,0.00046918515,0.000013279719,0.00080530834],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980882,0.000028371587,0.00066529866,0.00023897806,0.00031979685,0.0006593463],"domain_scores_gemma":[0.99903417,0.00032848347,0.00015343004,0.00023499483,0.000098159755,0.00015077693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045707205,0.00030670312,0.00035582643,0.00019715559,0.00050296984,0.0003220779,0.00030080188,0.00014273515,0.00020935606],"category_scores_gemma":[0.000057576806,0.00022170405,0.00012840523,0.0002943276,0.00022889688,0.0008919021,0.000035112436,0.0003401054,0.0003867923],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027778719,0.00008139597,0.94135743,0.0022142262,0.00065529573,0.000034525478,0.01678184,0.00090513896,0.000009371724,0.004001907,0.009042438,0.024638617],"study_design_scores_gemma":[0.0034197238,0.0014583599,0.14524071,0.0011850935,0.00028901105,0.00048667402,0.022653917,0.43160397,0.00018010379,0.0010858454,0.39063734,0.0017592752],"about_ca_topic_score_codex":0.00010575372,"about_ca_topic_score_gemma":0.0039878213,"teacher_disagreement_score":0.79611677,"about_ca_system_score_codex":0.000017523593,"about_ca_system_score_gemma":0.00007046254,"threshold_uncertainty_score":0.90408283},"labels":[],"label_agreement":null},{"id":"W6947881571","doi":"10.4230/lipics.concur.2024.1","title":"Constrained Horn Clauses for Program Verification and Synthesis (Invited Talk)","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Species Distribution and Climate Change","field":"Environmental Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Horn clause; Satisfiability modulo theories; Satisfiability; Modular design; Functional verification; Formal verification; Fragment (logic); Model checking; Software verification; Boolean satisfiability problem","score_opus":0.022973149667059788,"score_gpt":0.27529304916189234,"score_spread":0.2523198994948326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6947881571","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9633438,0.00018627605,0.0082905395,0.0024575037,0.0009756844,0.0044222097,0.006651494,0.00088392966,0.012788592],"genre_scores_gemma":[0.99230313,0.00015918796,0.0031213786,0.000955347,0.00008375052,0.0014098354,0.0016412942,0.000046264093,0.00027983548],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984963,0.000014173802,0.0005156601,0.0002577317,0.00024859174,0.000467544],"domain_scores_gemma":[0.99925715,0.00016909331,0.000120210345,0.00024615417,0.00004819928,0.00015922406],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00030502773,0.00025131562,0.00023059249,0.00007877906,0.000261588,0.00041194586,0.0002200145,0.0001594571,0.0016513126],"category_scores_gemma":[0.00015639572,0.00022107418,0.00014658281,0.00024012686,0.00032912625,0.0006670471,0.000113588954,0.00013037416,0.00025832234],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007352446,0.0022059933,0.011383796,0.0052207573,0.0007229111,0.000015739508,0.012363287,0.000038286238,0.0069048177,0.030449979,0.3448305,0.58512866],"study_design_scores_gemma":[0.0012705596,0.00030775776,0.0038184093,0.0001333422,0.000116240946,0.000052798943,0.0053849905,0.02189659,0.0047142794,0.00034500394,0.9614369,0.00052311434],"about_ca_topic_score_codex":0.000017940873,"about_ca_topic_score_gemma":0.00004319323,"teacher_disagreement_score":0.6166064,"about_ca_system_score_codex":0.00027494808,"about_ca_system_score_gemma":0.000012164564,"threshold_uncertainty_score":0.9992613},"labels":[],"label_agreement":null},{"id":"W6947892631","doi":"10.4230/lipics.ccc.2025.28","title":"Provably Total Functions in the Polynomial Hierarchy","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Subterranean biodiversity and taxonomy","field":"Earth and Planetary Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical proof; Hierarchy; Proof complexity; Polynomial hierarchy; Verifiable secret sharing; Complexity class; Polynomial; Function (biology)","score_opus":0.01700601913867475,"score_gpt":0.21106625707578397,"score_spread":0.19406023793710922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6947892631","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9011126,0.00005937719,0.0016056721,0.001209188,0.0014178563,0.001302565,0.0012844091,0.000070348804,0.09193797],"genre_scores_gemma":[0.9952068,0.000006290074,0.000770261,0.0020543346,0.00011537471,0.000016938757,0.0008666849,0.0000027543379,0.0009605848],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985742,0.00004883923,0.0004814191,0.00016571699,0.00023679314,0.00049305207],"domain_scores_gemma":[0.99922985,0.00021387803,0.00011099407,0.00032136377,0.000049414462,0.00007447347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045715758,0.00020520987,0.00021539391,0.00028532598,0.00048291526,0.00026051307,0.0005415254,0.00013527277,0.0004889188],"category_scores_gemma":[0.000048366208,0.00015001888,0.00016003617,0.00041681723,0.00015387693,0.0007549483,0.000047640566,0.0003682918,0.00038794908],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050980813,0.00018063071,0.89722383,0.00022191973,0.00013129768,0.00001048192,0.006477373,0.0004271946,0.0000018072889,0.00038099222,0.040499296,0.053935353],"study_design_scores_gemma":[0.004007592,0.00034454133,0.41775602,0.000086141605,0.00007020277,0.000063855856,0.010813767,0.019511728,0.000036228463,0.00026744287,0.5465454,0.0004971077],"about_ca_topic_score_codex":0.00060332695,"about_ca_topic_score_gemma":0.0010110646,"teacher_disagreement_score":0.5060461,"about_ca_system_score_codex":0.000020467787,"about_ca_system_score_gemma":0.00009703499,"threshold_uncertainty_score":0.61175925},"labels":[],"label_agreement":null},{"id":"W6947905639","doi":"10.4230/oasics.evcs.2023.7","title":"Generating Software for Well-Understood Domains","year":2023,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Species Distribution and Climate Change","field":"Environmental Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Software; Software development; Software construction; Traceability; Domain (mathematical analysis); Generative grammar; Software framework; Software system; Artifact (error)","score_opus":0.02883043313446245,"score_gpt":0.26353377811621864,"score_spread":0.23470334498175618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6947905639","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9026741,0.000021724298,0.061704848,0.0011805736,0.0016427478,0.0028862539,0.004672736,0.0010094934,0.02420752],"genre_scores_gemma":[0.9315311,0.00019871679,0.027908484,0.00914785,0.0006963083,0.002012223,0.018805506,0.00028657232,0.009413287],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99762493,0.00001673409,0.0007016895,0.0002790755,0.00045053987,0.00092700566],"domain_scores_gemma":[0.9988847,0.0001496399,0.00025276854,0.00043168914,0.00006130421,0.00021990197],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00047655223,0.00032157896,0.00030058235,0.00009553321,0.0007434655,0.0002289148,0.00049402256,0.00019106256,0.0046454538],"category_scores_gemma":[0.00017937354,0.00030166292,0.00025273464,0.00051701936,0.00017426579,0.000668754,0.00036977252,0.0001779117,0.0037458723],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026399535,0.00055657787,0.04270217,0.0010039387,0.00025078573,0.000010480241,0.012360934,0.002558667,0.0020197819,0.008063166,0.9157114,0.014498087],"study_design_scores_gemma":[0.004892336,0.0003386366,0.005790032,0.00005924432,0.0000675895,0.000029879136,0.017020464,0.035615344,0.0015929878,0.0007538891,0.93285227,0.0009873388],"about_ca_topic_score_codex":0.000020909452,"about_ca_topic_score_gemma":0.00013419667,"teacher_disagreement_score":0.036912136,"about_ca_system_score_codex":0.0005383692,"about_ca_system_score_gemma":0.00002011336,"threshold_uncertainty_score":0.99994355},"labels":[],"label_agreement":null},{"id":"W6947952523","doi":"10.4230/oasics.fmbc.2024.9","title":"Securing Aptos Framework with Formal Verification","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Species Distribution and Climate Change","field":"Environmental Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Software security assurance; Formal verification; Computer security model; Formal methods; Scale (ratio)","score_opus":0.013448743047231815,"score_gpt":0.24694661888885255,"score_spread":0.23349787584162074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6947952523","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85255456,0.00008342721,0.07402893,0.00066690263,0.0009471668,0.0012348462,0.0010157793,0.00055107573,0.06891732],"genre_scores_gemma":[0.9957872,0.00005120979,0.0021552138,0.0005698864,0.00009454132,0.00016673247,0.00074047066,0.000039364422,0.00039537012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998177,0.000011074014,0.0004867366,0.00023614324,0.00045526391,0.0006337948],"domain_scores_gemma":[0.999235,0.000060728693,0.00011954622,0.00038843608,0.000029563334,0.0001667695],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00028078628,0.0002683993,0.00019587479,0.00007345123,0.00031056436,0.0003800121,0.00035488096,0.00017139381,0.0070901457],"category_scores_gemma":[0.00003109578,0.00021606477,0.0001263484,0.0003662608,0.00016482684,0.001594106,0.00019596571,0.00033493483,0.002629095],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020007393,0.0021391052,0.12001709,0.006683173,0.0011863215,0.00010031992,0.117633194,0.0017370804,0.0028725371,0.4264325,0.17582983,0.14336812],"study_design_scores_gemma":[0.0016666739,0.00041743633,0.014290481,0.000398322,0.00009086518,0.0001244917,0.011250207,0.022000613,0.003017869,0.0009430614,0.94482166,0.0009783279],"about_ca_topic_score_codex":0.000018267143,"about_ca_topic_score_gemma":0.00003439635,"teacher_disagreement_score":0.7689918,"about_ca_system_score_codex":0.0004962951,"about_ca_system_score_gemma":0.000017636023,"threshold_uncertainty_score":0.9981475},"labels":[],"label_agreement":null},{"id":"W6947980100","doi":"10.4230/lipics.cosit.2024.2","title":"A Salience-Based Framework for Terrain Modelling: From the Surface Network to Topo-Contexts","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Freshwater macroinvertebrate diversity and ecology","field":"Environmental Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Terrain; Landform; Thalweg; Context (archaeology); Ridge; Surface (topology); Raster graphics; Representation (politics)","score_opus":0.01848759906345466,"score_gpt":0.2391844336549695,"score_spread":0.22069683459151485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6947980100","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34974876,0.000072667135,0.6399576,0.0039793407,0.0017474395,0.001832363,0.0014822334,0.00018493392,0.0009946829],"genre_scores_gemma":[0.8881368,0.000012372971,0.092152074,0.017851936,0.00036251105,0.00016344579,0.0005953647,0.000059849313,0.0006656413],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977077,0.000042978085,0.0005889635,0.0003950679,0.00034047442,0.00092478376],"domain_scores_gemma":[0.99845517,0.00063451624,0.00011675639,0.000534677,0.000030519357,0.00022834686],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00062462647,0.0003431205,0.0003310748,0.000039928964,0.00062192796,0.0004341333,0.0009744245,0.00025909656,0.0007459564],"category_scores_gemma":[0.000063979816,0.00026236215,0.00026902326,0.00032139584,0.00022969586,0.0006282753,0.0004096183,0.00037811475,0.0013042291],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005797296,0.00018352961,0.016320948,0.00021894585,0.00021562778,0.00001115588,0.026808096,0.6335765,0.00006622454,0.007864856,0.3093801,0.004774241],"study_design_scores_gemma":[0.00068299175,0.00023911326,0.00023149105,0.0001514639,0.000053444204,0.0000032183725,0.0007545683,0.66901636,0.00030105392,0.01319442,0.31497782,0.0003940271],"about_ca_topic_score_codex":0.00037974294,"about_ca_topic_score_gemma":0.0007349551,"teacher_disagreement_score":0.5478055,"about_ca_system_score_codex":0.00023107893,"about_ca_system_score_gemma":0.0000407831,"threshold_uncertainty_score":0.99998283},"labels":[],"label_agreement":null},{"id":"W6947992690","doi":"10.4230/lipics.icalp.2025.20","title":"Improved Approximation Algorithms for Capacitated Network Design and Flexible Graph Connectivity","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Approximation algorithm; Rounding; Graph; Set cover problem; Strength of a graph; Set (abstract data type); Graph theory; Connected dominating set; Network planning and design; Graph algorithms","score_opus":0.02941959307669111,"score_gpt":0.2704119662591975,"score_spread":0.24099237318250638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6947992690","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042554606,0.00011532344,0.9899034,0.00041435097,0.0013257011,0.0028980728,0.00016783013,0.0004280819,0.00049179676],"genre_scores_gemma":[0.063192725,0.000047041547,0.9341657,0.0011703988,0.00014381592,0.00078778993,0.00022271274,0.00003236923,0.00023742947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974219,0.00008038471,0.00091439276,0.00045552084,0.00026055318,0.0008672344],"domain_scores_gemma":[0.9975665,0.00074276497,0.0003709543,0.00073256367,0.00042283544,0.00016436493],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014326553,0.00042771501,0.0005352401,0.000388059,0.0008779722,0.0006990777,0.0009418864,0.00024021421,0.0000031569468],"category_scores_gemma":[0.00015647813,0.00041165616,0.0002463341,0.00093570264,0.00020653369,0.0017524813,0.00038873364,0.00032634026,0.0000040769783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006485818,0.00089268765,0.0009647448,0.002654632,0.0010613208,0.0000030671215,0.009934898,0.006464809,0.00035684954,0.6561592,0.019670654,0.30118853],"study_design_scores_gemma":[0.002930622,0.00032274702,0.00020818778,0.00013331007,0.000042436026,0.000014736204,0.00022320129,0.88780296,0.0017490165,0.098231815,0.007890867,0.000450082],"about_ca_topic_score_codex":0.000024232853,"about_ca_topic_score_gemma":0.00001092706,"teacher_disagreement_score":0.8813382,"about_ca_system_score_codex":0.000089569425,"about_ca_system_score_gemma":0.00013068141,"threshold_uncertainty_score":0.9998335},"labels":[],"label_agreement":null},{"id":"W6948012238","doi":"10.4230/lipics.cp.2023.14","title":"Fast Matrix Multiplication Without Tears: A Constraint Programming Approach","year":2023,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Evolution and Paleontology Studies","field":"Earth and Planetary Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Matrix multiplication; Multiplication (music); Matrix (chemical analysis); Correctness; Set (abstract data type); Simple (philosophy); Constraint satisfaction problem; Constraint programming; Constraint (computer-aided design)","score_opus":0.026217973178348966,"score_gpt":0.27583967758997346,"score_spread":0.2496217044116245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6948012238","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87835723,0.00043230422,0.037973225,0.0011793957,0.0016658758,0.005191566,0.002742277,0.0018450439,0.07061311],"genre_scores_gemma":[0.9720394,0.00006823597,0.024438515,0.00029393943,0.00014244935,0.000084586645,0.0021173072,0.000012510512,0.0008030271],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9978713,0.0000452676,0.00072611234,0.00026227892,0.00034369403,0.0007513496],"domain_scores_gemma":[0.99889505,0.00015040369,0.00028792446,0.0003335686,0.00014833428,0.00018469311],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006334497,0.00029555315,0.00036696604,0.0002536378,0.00054916495,0.00017032024,0.0003660663,0.00019706738,0.00008055178],"category_scores_gemma":[0.000110674984,0.00024546226,0.00016719743,0.00045161752,0.00032520687,0.00054027693,0.00004780933,0.00030386503,0.0008866847],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096251715,0.00008387448,0.92387015,0.0004163263,0.0001757945,0.0000025427075,0.008938514,0.0009660687,0.000005787008,0.0006951841,0.003619943,0.06112957],"study_design_scores_gemma":[0.0035418998,0.0003235876,0.4531442,0.00011175417,0.00009153617,0.00013865635,0.023931187,0.3654029,0.000021111124,0.00026514663,0.1521541,0.0008738995],"about_ca_topic_score_codex":0.00011623616,"about_ca_topic_score_gemma":0.0010053777,"teacher_disagreement_score":0.47072592,"about_ca_system_score_codex":0.000016223288,"about_ca_system_score_gemma":0.000052524912,"threshold_uncertainty_score":0.99999976},"labels":[],"label_agreement":null},{"id":"W6948081770","doi":"10.4230/lipics.itc.2023.12","title":"Randomness Recoverable Secret Sharing Schemes","year":2023,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Animal and Plant Science Education","field":"Psychology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Randomness; Cryptography; Cryptographic primitive; Secret sharing; Access structure; Encryption; Context (archaeology)","score_opus":0.046655546106840105,"score_gpt":0.33224128124430574,"score_spread":0.28558573513746566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6948081770","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.946808,0.00004397692,0.0034561357,0.00048240984,0.0040714866,0.0009332606,0.0005147431,0.00042039435,0.043269604],"genre_scores_gemma":[0.9769006,0.000053325657,0.001108133,0.0009529561,0.00052887487,0.0003501404,0.0019087272,0.00005226096,0.018145008],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99772596,0.00002869075,0.0007511072,0.00030867913,0.00033406186,0.0008514857],"domain_scores_gemma":[0.9986815,0.00022406835,0.00028158512,0.00049107574,0.00013773711,0.00018406735],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0010646324,0.0002764867,0.0003498165,0.0003099916,0.000442546,0.00023891848,0.0006491764,0.00021699151,0.0010095361],"category_scores_gemma":[0.0001200238,0.00024257755,0.00018099418,0.0006307062,0.0000872385,0.00097127276,0.00015923085,0.00032082983,0.0037065134],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002235607,0.00088917295,0.36390892,0.0014786997,0.00076275575,0.00003254831,0.11335645,0.00028422894,0.0006677013,0.08771713,0.38623413,0.042432632],"study_design_scores_gemma":[0.010125749,0.00047100201,0.03896335,0.00032321742,0.0000987677,0.00016894027,0.023784334,0.025430072,0.00074704946,0.005247833,0.8932035,0.0014361899],"about_ca_topic_score_codex":0.000057568705,"about_ca_topic_score_gemma":0.000014985715,"teacher_disagreement_score":0.50696933,"about_ca_system_score_codex":0.00006437941,"about_ca_system_score_gemma":0.00005680527,"threshold_uncertainty_score":0.9999037},"labels":[],"label_agreement":null},{"id":"W6948095673","doi":"10.4230/dagrep.12.6","title":"Dagstuhl Reports, Volume 12, Issue 6, June 2022, Complete Issue","year":2023,"lang":"en","type":"other","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Universidade do Porto; Università di Bologna; Universitetet i Bergen; Simon Fraser University; Aalto-Yliopisto; University of Sussex; London School of Economics and Political Science; University College London; University of Toronto; University of Cyprus; Institut national de recherche en informatique et en automatique (INRIA); University of Central Florida; Technische Universiteit Delft; Aarhus Universitet; Sorbonne Université; Microsoft Research","keywords":"Volume (thermodynamics); Term (time); Work (physics)","score_opus":0.011667609168178479,"score_gpt":0.24313989711971695,"score_spread":0.23147228795153849,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6948095673","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013668354,0.011989808,0.005527859,0.0024181511,0.040367134,0.013210521,0.03289313,0.0012737527,0.8786513],"genre_scores_gemma":[0.0044332,0.005861605,0.004254695,0.0014406967,0.0045798146,0.00056040264,0.0074597853,0.0022778604,0.96913195],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99573463,0.000049576727,0.0016447513,0.0008457308,0.00053592015,0.0011894116],"domain_scores_gemma":[0.9963471,0.00003587732,0.0012322223,0.0018427701,0.00023500099,0.00030701855],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00053213077,0.0010712629,0.001154512,0.00038304014,0.000316535,0.0001863677,0.00087821967,0.0010560766,0.0006596854],"category_scores_gemma":[0.00016448977,0.0010560757,0.00060224853,0.00022879409,0.00029083458,0.000008698583,0.00097581476,0.00047717153,0.0010175195],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006578215,0.00013770831,0.0019217778,0.00067325943,0.0011115298,0.000024229617,0.0004493687,0.000021493703,0.0009897088,0.00006474948,0.992319,0.002221381],"study_design_scores_gemma":[0.0013467033,0.0003467929,0.0003085891,0.00020551252,0.00018017265,0.00009335277,0.00039414593,0.00013702974,0.00055637927,0.0000646362,0.9951932,0.0011735089],"about_ca_topic_score_codex":0.00022557187,"about_ca_topic_score_gemma":0.0010392974,"teacher_disagreement_score":0.09048065,"about_ca_system_score_codex":0.000074033574,"about_ca_system_score_gemma":0.00014369305,"threshold_uncertainty_score":0.9997603},"labels":[],"label_agreement":null},{"id":"W6948107546","doi":"10.4230/lipics.ccc.2023.20","title":"Radical Sylvester-Gallai Theorem for Tuples of Quadratics","year":2023,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Libraries and Information Services","field":"Arts and Humanities","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Codimension; Intersection theorem; Structured program theorem; Generalization; Dimension (graph theory); Polynomial ring; Quadratic equation; Representation theorem; Tuple","score_opus":0.04069580873162518,"score_gpt":0.2546487382397094,"score_spread":0.21395292950808423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6948107546","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7772884,0.00018364332,0.013641618,0.004561203,0.0065518776,0.0069772485,0.015331669,0.001633082,0.17383125],"genre_scores_gemma":[0.97531986,0.00015652682,0.0052575218,0.004381244,0.0014354816,0.0005061103,0.006045759,0.00015037545,0.006747142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972364,0.000020458248,0.0015461758,0.00014810961,0.00042810655,0.00062079326],"domain_scores_gemma":[0.9979823,0.00038848503,0.0006255811,0.00045723096,0.00039687246,0.00014951042],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005470414,0.00033505706,0.0005348588,0.00031422815,0.00056341814,0.00065944786,0.0006474806,0.00015825957,0.0004863404],"category_scores_gemma":[0.00009389219,0.0002651516,0.0003570251,0.000147977,0.00041365213,0.0026387854,0.00020038312,0.00017762913,0.00022218276],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018916637,0.00011822952,0.0003814623,0.002245066,0.00021298505,4.826262e-7,0.110167675,0.00006965394,0.000011945648,0.83444256,0.049202822,0.0029579864],"study_design_scores_gemma":[0.002198672,0.00036172188,0.00009741088,0.00015668632,0.000058973783,0.0000041676312,0.036310125,0.026348623,0.0005428769,0.0076264027,0.92588377,0.00041059192],"about_ca_topic_score_codex":0.000021097268,"about_ca_topic_score_gemma":0.00006188374,"teacher_disagreement_score":0.8766809,"about_ca_system_score_codex":0.00003044695,"about_ca_system_score_gemma":0.00008409297,"threshold_uncertainty_score":0.9999801},"labels":[],"label_agreement":null},{"id":"W6948520361","doi":"10.4230/lipics.ccc.2023.15","title":"Near-Optimal Set-Multilinear Formula Lower Bounds","year":2023,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Diptera species taxonomy and behavior","field":"Agricultural and Biological Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Iterated function; Upper and lower bounds; Polynomial; Algebraic number; Branching (polymer chemistry); Matrix multiplication; Field (mathematics)","score_opus":0.032328558713071935,"score_gpt":0.2576378728893339,"score_spread":0.22530931417626193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6948520361","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99266666,0.000013142692,0.000076557575,0.00052080344,0.00090032205,0.00087895605,0.001377792,0.0004445273,0.0031212198],"genre_scores_gemma":[0.99159455,0.000029085759,0.0014666722,0.00083810027,0.0004686363,0.00017815364,0.0023717112,0.000007701997,0.003045397],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973193,0.00002271816,0.0008591712,0.0003085804,0.00046173605,0.0010285099],"domain_scores_gemma":[0.99889475,0.00016897284,0.00025478358,0.00022372155,0.00018677645,0.00027098853],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004160194,0.0004080527,0.00041443916,0.000051914005,0.0007706816,0.0006917515,0.00071190257,0.00028909583,0.0007107473],"category_scores_gemma":[0.000058698526,0.0001876559,0.00041216423,0.0005884609,0.0001846234,0.0010731672,0.00034198049,0.00033779058,0.0014820665],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013919503,0.0020417513,0.07774394,0.00058124715,0.0004391037,0.00009057298,0.008767311,0.00051970157,0.005398553,0.0025063194,0.14234585,0.7581737],"study_design_scores_gemma":[0.00097041816,0.0005157152,0.009199195,0.000048212976,0.000034644087,0.000020099706,0.0016184247,0.009770293,0.00074145023,0.0000306134,0.9765232,0.00052772614],"about_ca_topic_score_codex":0.000038603775,"about_ca_topic_score_gemma":0.000107969754,"teacher_disagreement_score":0.8341774,"about_ca_system_score_codex":0.00007709059,"about_ca_system_score_gemma":0.00002534698,"threshold_uncertainty_score":0.9992954},"labels":[],"label_agreement":null},{"id":"W6966298626","doi":"10.4230/lipics.approx/random.2024.67","title":"Explicit and Near-Optimal Construction of t-Rankwise Independent Permutations","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Permutation (music); Random permutation; Order (exchange); Set (abstract data type); Random variable; Upper and lower bounds","score_opus":0.01949977994498601,"score_gpt":0.29544373984220373,"score_spread":0.2759439598972177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6966298626","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96754843,0.00018383609,0.026532954,0.00010926996,0.0009385679,0.0008103493,0.00067043153,0.00017499163,0.0030311653],"genre_scores_gemma":[0.96125126,0.000062545565,0.03812035,0.000090563764,0.00010068095,0.00006760288,0.00009568813,0.000049024122,0.00016229023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99799436,0.000033193635,0.0009942928,0.00021453455,0.00038323874,0.00038036134],"domain_scores_gemma":[0.9986601,0.00038045345,0.00024929395,0.00039590776,0.0001834557,0.00013079187],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045613584,0.00030452752,0.0004152273,0.00025461227,0.00038521478,0.0002531898,0.00025156108,0.00022459381,0.00009056766],"category_scores_gemma":[0.00014847932,0.0002525132,0.00023168685,0.00022310765,0.0003244945,0.00071369944,0.00019726777,0.0003620832,0.000010362969],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012766523,0.000104487204,0.0018383699,0.0025896193,0.0004172629,0.000006395987,0.037258882,0.000057009653,0.00014195709,0.9460194,0.0013984856,0.010040483],"study_design_scores_gemma":[0.007016294,0.0009695109,0.0024986102,0.0015701957,0.0009840612,0.001388081,0.028383575,0.10519618,0.005881178,0.7938876,0.050239135,0.0019855376],"about_ca_topic_score_codex":0.0000068269587,"about_ca_topic_score_gemma":0.0000048566862,"teacher_disagreement_score":0.15213174,"about_ca_system_score_codex":0.000053412205,"about_ca_system_score_gemma":0.000067235116,"threshold_uncertainty_score":0.9999927},"labels":[],"label_agreement":null},{"id":"W6966428720","doi":"10.4230/artifacts.23555","title":"Travelling Salesperson Problem with Self Deleting Graphs","year":2024,"lang":"en","type":"other","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Code (set theory); Source code; Field (mathematics); Set (abstract data type)","score_opus":0.008824150382975711,"score_gpt":0.23078614731428884,"score_spread":0.22196199693131313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6966428720","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00076951704,0.0013282197,0.3767796,0.00005907001,0.0017215518,0.0033462467,0.0011255952,0.0076169074,0.6072533],"genre_scores_gemma":[0.0024866476,0.00063531793,0.930023,0.0002160116,0.00071590027,0.00036876078,0.001133427,0.003815688,0.060605235],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99700147,0.00003971775,0.0010975532,0.0003829301,0.0005251012,0.0009532266],"domain_scores_gemma":[0.9985891,0.00008837867,0.0003678502,0.00062147423,0.00011271333,0.00022048931],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062272954,0.00090329116,0.00081678777,0.0008325358,0.00011966759,0.00042771158,0.0005391362,0.00071730145,0.00018669134],"category_scores_gemma":[0.000023107585,0.00081593136,0.0002862542,0.0006317279,0.00007720953,0.0002935125,0.00009286936,0.0010150636,0.00041402836],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016522812,0.0004122175,0.0011283439,0.07043119,0.0071829674,0.00009127732,0.058256052,0.10709024,0.00008092732,0.0065538497,0.7158216,0.032786053],"study_design_scores_gemma":[0.0016777588,0.00013551721,0.000004624706,0.0034191806,0.0003575187,0.00009732968,0.0010084485,0.30828038,0.00016876766,0.00012468651,0.6832409,0.0014849067],"about_ca_topic_score_codex":0.000012616981,"about_ca_topic_score_gemma":0.000023944398,"teacher_disagreement_score":0.55324346,"about_ca_system_score_codex":0.00019765369,"about_ca_system_score_gemma":0.000057953817,"threshold_uncertainty_score":0.99942917},"labels":[],"label_agreement":null},{"id":"W6966470547","doi":"10.4230/lipics.isaac.2024.20","title":"Revisit the Scheduling Problem with Calibrations","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Stockpile; Scheduling (production processes); Schedule; Job shop scheduling; Calibration; Time complexity; Robot","score_opus":0.008909819028516699,"score_gpt":0.22157246137045863,"score_spread":0.21266264234194193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6966470547","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017175669,0.00079095154,0.96736574,0.0009988409,0.0010554446,0.0013000325,0.0003047249,0.0017465631,0.009262042],"genre_scores_gemma":[0.4956174,0.00027672577,0.4996387,0.00093909027,0.0007496057,0.0005121158,0.000918578,0.00025590297,0.0010918715],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985103,0.000013566594,0.0006052227,0.00015144033,0.00028886736,0.00043057962],"domain_scores_gemma":[0.9991983,0.00012157349,0.00005983735,0.00038197404,0.00012340893,0.000114896044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031859922,0.00028737268,0.00022290635,0.00016039779,0.0002961759,0.00076820544,0.0003311509,0.0001312881,0.000060795857],"category_scores_gemma":[0.000026320637,0.00019006284,0.00012384719,0.0004924149,0.00007130014,0.0008919715,0.000050595037,0.0004519117,0.00016728562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038984585,0.00007284524,0.0005767441,0.0026552847,0.00069026445,0.000010270952,0.014577255,0.9337983,0.000038118906,0.022584202,0.006745013,0.018212687],"study_design_scores_gemma":[0.00048162806,0.00005162911,0.000022270911,0.00038327306,0.00006275564,0.000051705912,0.0009798617,0.94443,0.00027720424,0.00017212775,0.052780584,0.00030696226],"about_ca_topic_score_codex":0.0000029324287,"about_ca_topic_score_gemma":0.0000060716106,"teacher_disagreement_score":0.47844172,"about_ca_system_score_codex":0.00007486405,"about_ca_system_score_gemma":0.000059779602,"threshold_uncertainty_score":0.7750538},"labels":[],"label_agreement":null},{"id":"W6966557460","doi":"10.4230/lipics.sand.2025.12","title":"Restless Exploration and Token Dissemination in Vertex-Permuted Temporal Graphs","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Security token; Graph; Vertex (graph theory); Class (philosophy); Topological graph theory; Graph property; Base (topology)","score_opus":0.013628539163856566,"score_gpt":0.27549746770986394,"score_spread":0.26186892854600735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6966557460","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10619637,0.0000896148,0.8844104,0.001108289,0.0009775376,0.0009128473,0.00007092227,0.00016892835,0.0060651056],"genre_scores_gemma":[0.9912808,0.0001070671,0.007060113,0.0006021711,0.000025282106,0.000107466956,0.00038681814,0.0000130067165,0.00041729741],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980712,0.000042428266,0.00087390246,0.00027800942,0.00029244603,0.00044201294],"domain_scores_gemma":[0.9987974,0.00017915056,0.00022819589,0.00050083536,0.00017183613,0.0001225728],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000530916,0.00026472216,0.00033338004,0.0004467071,0.00022294093,0.00042057753,0.0005659345,0.000199401,0.0000051844336],"category_scores_gemma":[0.000028246972,0.0002500305,0.000082317165,0.00062770274,0.000085671825,0.0023687426,0.00028224208,0.00027003617,0.000010204909],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038387536,0.00083296007,0.062257126,0.0012444557,0.00019752707,0.000049820963,0.02673697,0.00033187843,0.00010786149,0.3020462,0.04317126,0.5626401],"study_design_scores_gemma":[0.0020379382,0.00011935842,0.002937628,0.00043074574,0.000020557736,0.000015665613,0.0010522682,0.9677581,0.00014668038,0.015732711,0.009343834,0.00040447954],"about_ca_topic_score_codex":0.000023112114,"about_ca_topic_score_gemma":0.000049667407,"teacher_disagreement_score":0.96742624,"about_ca_system_score_codex":0.000078502395,"about_ca_system_score_gemma":0.00008775495,"threshold_uncertainty_score":0.9999952},"labels":[],"label_agreement":null},{"id":"W6966632337","doi":"10.4230/lipics.sea.2023.19","title":"Exact and Approximate Range Mode Query Data Structures in Practice","year":2023,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Range (aeronautics); Mode (computer interface); Range query (database); Space (punctuation); Data structure; Element (criminal law)","score_opus":0.03281440660623704,"score_gpt":0.3182803132095328,"score_spread":0.2854659066032958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6966632337","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10816008,0.00042932504,0.87649465,0.0018679292,0.001969065,0.0024926106,0.003767365,0.0010480287,0.0037709277],"genre_scores_gemma":[0.5168743,0.0013859866,0.47041273,0.0033620265,0.0004722958,0.00024972606,0.00680865,0.00013145639,0.00030284873],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975059,0.00006330512,0.00077563385,0.00047151884,0.0005086573,0.0006750035],"domain_scores_gemma":[0.9972424,0.00034382683,0.00032618444,0.0017980684,0.00011564672,0.00017388111],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009858186,0.00031965654,0.00036936277,0.00035631997,0.00025794466,0.0006781371,0.002069218,0.00016581641,0.000005357409],"category_scores_gemma":[0.000274637,0.00026796883,0.000053996362,0.00055966765,0.00007794971,0.007091201,0.00292346,0.0003911927,0.000049982496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011437718,0.00150043,0.024365047,0.004933052,0.0008165616,0.0004121944,0.0799528,0.005815953,0.0002793676,0.18552026,0.2223926,0.47286797],"study_design_scores_gemma":[0.0018365376,0.00007084322,0.0022439014,0.000108673325,0.000017858441,0.00008242644,0.00097371975,0.9257866,0.000056821533,0.0024046034,0.0660211,0.00039688166],"about_ca_topic_score_codex":0.000121536366,"about_ca_topic_score_gemma":0.000026008962,"teacher_disagreement_score":0.9199707,"about_ca_system_score_codex":0.0000496786,"about_ca_system_score_gemma":0.000073184085,"threshold_uncertainty_score":0.99997723},"labels":[],"label_agreement":null},{"id":"W6966804948","doi":"10.4230/lipics.cosit.2024.30","title":"Wheelchair Users Navigational Behavior: Insights from Eye Movement Data and Environment Legibility (Short Paper)","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Gaze Tracking and Assistive Technology","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Centre for Interdisciplinary Research in Rehabilitation; Centre de Géomatique du Québec","funders":"","keywords":"Legibility; Eye movement; Wheelchair; Cognition; Process (computing); Fixation (population genetics)","score_opus":0.022895423866908904,"score_gpt":0.2724276601275259,"score_spread":0.249532236260617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6966804948","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7476028,0.00048015424,0.24528883,0.0013704363,0.0010777463,0.001022894,0.0020725187,0.0006425361,0.00044206166],"genre_scores_gemma":[0.9689644,0.000095546886,0.028407304,0.00059593347,0.000093636474,0.00014043423,0.0016040026,0.00002736758,0.00007138638],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973818,0.000033934182,0.000837365,0.0007188396,0.0005514983,0.000476548],"domain_scores_gemma":[0.99779445,0.00013518568,0.00012805329,0.0017094717,0.000058526224,0.0001743335],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037391545,0.0003790315,0.00034347046,0.00017272444,0.00028674369,0.000565508,0.0016516285,0.0002219481,0.000028622608],"category_scores_gemma":[0.000027547016,0.00033188175,0.000106941494,0.00018081043,0.00025320423,0.0023744947,0.0016053993,0.00047639763,0.0000911956],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012988523,0.0027866683,0.2251142,0.0013708973,0.0015971687,0.00020225711,0.024846694,0.00027238778,0.004978608,0.17640048,0.0154190725,0.5468817],"study_design_scores_gemma":[0.0027021694,0.0006079681,0.18285702,0.000590922,0.00027660574,0.000047892005,0.0016775925,0.42211512,0.003458819,0.022053692,0.36162892,0.0019833036],"about_ca_topic_score_codex":0.00004193793,"about_ca_topic_score_gemma":0.000028420145,"teacher_disagreement_score":0.5448984,"about_ca_system_score_codex":0.00017944617,"about_ca_system_score_gemma":0.00007354348,"threshold_uncertainty_score":0.99991333},"labels":[],"label_agreement":null},{"id":"W6966805628","doi":"10.4230/darts.8.2.12","title":"REST: Integrating Term Rewriting with Program Verification (Artifact)","year":2022,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Oral and Maxillofacial Pathology","field":"Dentistry","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Haskell; Rewriting; Artifact (error); Term (time); Functional programming; Scripting language; Rest (music); Code (set theory)","score_opus":0.018335155541670384,"score_gpt":0.2853478558821857,"score_spread":0.26701270034051533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6966805628","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98484087,0.000023581522,0.0024669105,0.00018697388,0.0008693804,0.0018395851,0.00064738677,0.00050258246,0.008622705],"genre_scores_gemma":[0.9859423,0.0000043669625,0.009747599,0.00051651685,0.00014738971,0.0010508026,0.0015631912,0.00006676843,0.00096106424],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99727535,0.000076388205,0.0010351666,0.00032958307,0.0005452471,0.00073824875],"domain_scores_gemma":[0.99837303,0.000059895352,0.0006103762,0.00059313653,0.00021197746,0.0001516095],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005993813,0.00035593344,0.00040810293,0.0002022254,0.0010097922,0.00029614908,0.0005655147,0.00014233378,0.00022878882],"category_scores_gemma":[0.0001240957,0.00030969776,0.0001817206,0.0003834513,0.00014729788,0.00082546874,0.00037708285,0.00076021435,0.00016665578],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030776956,0.003621662,0.27486703,0.00274036,0.0006795635,0.00044396907,0.03847424,0.0006168697,0.0075625633,0.030816155,0.008640549,0.62845933],"study_design_scores_gemma":[0.013167243,0.0060232067,0.0758014,0.00046089073,0.00034943083,0.0031363473,0.05151946,0.019733649,0.0060754544,0.0012816113,0.81933194,0.0031193793],"about_ca_topic_score_codex":0.0000448251,"about_ca_topic_score_gemma":0.0000712291,"teacher_disagreement_score":0.81069136,"about_ca_system_score_codex":0.0002026929,"about_ca_system_score_gemma":0.00008074122,"threshold_uncertainty_score":0.9999355},"labels":[],"label_agreement":null},{"id":"W6966814896","doi":"10.4230/lipics.aofa.2024.2","title":"Enumeration and Succinct Encoding of AVL Trees","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Enumeration; Tree (set theory); Class (philosophy); Node (physics); Encoding (memory); Variety (cybernetics); Upper and lower bounds; Constant (computer programming)","score_opus":0.01592361490010857,"score_gpt":0.25835598425096706,"score_spread":0.2424323693508585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6966814896","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12974624,0.00052838237,0.8624513,0.00060896843,0.0016085547,0.0006391715,0.00021180224,0.0003514695,0.0038540876],"genre_scores_gemma":[0.9636811,0.000091250186,0.035701595,0.0001801937,0.00010958108,0.000029206603,0.00006114789,0.000015492196,0.0001304607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836254,0.000023683171,0.0007121486,0.0002307889,0.00032093612,0.00034992333],"domain_scores_gemma":[0.99900305,0.00020869619,0.00014916465,0.00042307592,0.00011466923,0.00010133726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000493315,0.00022432157,0.00028275576,0.0003304254,0.00021635326,0.000558895,0.0005814659,0.00010225224,0.000015744617],"category_scores_gemma":[0.000045766366,0.0001986373,0.00016183723,0.0003974508,0.000105945575,0.0018996593,0.00032687717,0.00022533876,0.000020609967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045040182,0.00023902202,0.0034337381,0.002302725,0.0003180376,0.000016850901,0.03681292,0.00024339082,0.0008578907,0.62848556,0.0035975447,0.3236473],"study_design_scores_gemma":[0.0010826517,0.00034331606,0.0014263823,0.00047012375,0.00003887274,0.000118746284,0.0005851778,0.91897243,0.004662583,0.014852019,0.05693542,0.00051227806],"about_ca_topic_score_codex":0.000016946567,"about_ca_topic_score_gemma":0.00002015215,"teacher_disagreement_score":0.91872907,"about_ca_system_score_codex":0.000038047256,"about_ca_system_score_gemma":0.00005567575,"threshold_uncertainty_score":0.81001943},"labels":[],"label_agreement":null},{"id":"W6966861328","doi":"10.4230/lipics.opodis.2024.5","title":"RMR-Efficient Detectable Objects for Persistent Memory and Their Applications","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mutual exclusion; Synchronization (alternating current); Process (computing); Multiprocessing; Reduction (mathematics); Blocking (statistics); Lock (firearm); Distributed shared memory; Shared memory","score_opus":0.008127687837484215,"score_gpt":0.2321173209926717,"score_spread":0.2239896331551875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6966861328","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01076507,0.0005118679,0.97795826,0.00036926768,0.0006328442,0.002789702,0.0006782839,0.00020370117,0.006090981],"genre_scores_gemma":[0.9797362,0.000019641195,0.016327862,0.0009388728,0.000083732564,0.0016515021,0.00017639603,0.000021882224,0.0010438988],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801743,0.00002008105,0.0007672388,0.00036300955,0.00020660945,0.00062565895],"domain_scores_gemma":[0.9982379,0.00017993864,0.00026137521,0.0008196789,0.00034312624,0.00015797146],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00049526035,0.0003216816,0.00041107426,0.00020480857,0.0006142586,0.0005179457,0.0009367141,0.00015548203,0.0000024195383],"category_scores_gemma":[0.000044990746,0.00026781348,0.00027760473,0.00042985295,0.00009046079,0.00050332095,0.00034525545,0.00017850476,0.000017617063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041226883,0.0025588893,0.0014378985,0.01131737,0.0018917865,0.000004164305,0.05937604,0.011193808,0.0016081125,0.3709307,0.039855223,0.49941376],"study_design_scores_gemma":[0.0031560957,0.00020531875,0.000136333,0.00024799327,0.000045342964,0.00003120374,0.0047013736,0.7181038,0.002083268,0.0010628087,0.26966497,0.00056144554],"about_ca_topic_score_codex":0.000011374351,"about_ca_topic_score_gemma":0.0000112022135,"teacher_disagreement_score":0.96897113,"about_ca_system_score_codex":0.000121217265,"about_ca_system_score_gemma":0.0001250131,"threshold_uncertainty_score":0.9999774},"labels":[],"label_agreement":null},{"id":"W6966867884","doi":"10.4230/lipics.itcs.2023.23","title":"On Low-End Obfuscation and Learning","year":2023,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation","keywords":"Obfuscation; Multilinear map; Cryptography; Class (philosophy); Simple (philosophy); Representation (politics); Context (archaeology); Learning with errors","score_opus":0.009901839214712521,"score_gpt":0.2411788112378562,"score_spread":0.23127697202314368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6966867884","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7552587,0.000033598313,0.23743366,0.0005336526,0.00086497836,0.0007362341,0.00025115698,0.000843696,0.004044363],"genre_scores_gemma":[0.98793614,0.00009787057,0.010209727,0.0007517733,0.00008465125,0.000071205766,0.0007451235,0.000022498272,0.00008102791],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982446,0.000043802487,0.0005172327,0.00028017245,0.00038952366,0.0005246629],"domain_scores_gemma":[0.9986345,0.0003014257,0.00021080051,0.00058094633,0.000106177635,0.0001661498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073163986,0.0002440725,0.00023140929,0.00040855,0.0005386042,0.0005228478,0.000672325,0.0001347943,0.000015012519],"category_scores_gemma":[0.00016322064,0.00022711405,0.0001240152,0.0007093527,0.000085301006,0.0016873425,0.0004271645,0.00042845693,0.00025825124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001494794,0.00040642585,0.010496529,0.0011047112,0.00017825323,0.000014891298,0.042042434,0.0005887262,0.00021834232,0.78993756,0.021540118,0.13332254],"study_design_scores_gemma":[0.0069754855,0.0013695568,0.042534407,0.00054854085,0.000054237527,0.00008942089,0.003951863,0.70734096,0.0014778911,0.05089668,0.18281423,0.0019467431],"about_ca_topic_score_codex":0.000010656181,"about_ca_topic_score_gemma":0.000005328333,"teacher_disagreement_score":0.73904085,"about_ca_system_score_codex":0.000032681994,"about_ca_system_score_gemma":0.00003135645,"threshold_uncertainty_score":0.92614424},"labels":[],"label_agreement":null},{"id":"W6966981988","doi":"10.4230/lipics.cpm.2024.12","title":"Solving the Minimal Positional Substring Cover Problem in Sublinear Space","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Genetic Associations and Epidemiology","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Università degli Studi di Milano-Bicocca; Israel Institute for Biological Research; Ministero dell’Istruzione, dell’Università e della Ricerca; National Institute of Allergy and Infectious Diseases; Natural Sciences and Engineering Research Council of Canada; European Commission; Dipartimenti di Eccellenza; National Institutes of Health; National Science Foundation","keywords":"Substring; Sublinear function; Computation; Set (abstract data type); Cover (algebra); Encoding (memory); Key (lock); Space (punctuation)","score_opus":0.010861251447455639,"score_gpt":0.26062918238207117,"score_spread":0.24976793093461552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6966981988","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9805395,0.0006910745,0.0113366945,0.0019321525,0.0005141223,0.00072931126,0.000397138,0.000039247625,0.0038207665],"genre_scores_gemma":[0.98942345,0.00014305228,0.0075475266,0.00065425696,0.00032499983,0.00010927074,0.0009820224,0.000032135613,0.0007832795],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983876,0.000049208757,0.0006468179,0.00023028342,0.0001707855,0.0005153559],"domain_scores_gemma":[0.9992917,0.00011056262,0.00013695651,0.00027945713,0.000110022214,0.00007128254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077384664,0.00021921666,0.00021541044,0.00010879249,0.00017915388,0.00015427907,0.00029670633,0.00024635057,0.000032028933],"category_scores_gemma":[0.00013009059,0.0001699627,0.00018503322,0.00017765838,0.00008806907,0.000032821314,0.00018119301,0.0002753614,0.00006945305],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010843739,0.0011876317,0.59493726,0.00345352,0.0023521986,0.00003954333,0.017511036,0.022030417,0.03495948,0.029337807,0.27465996,0.018446788],"study_design_scores_gemma":[0.0042000236,0.00083132717,0.07569809,0.00041946684,0.00014048643,0.0002451427,0.002965132,0.117109776,0.005385614,0.0017851387,0.7898714,0.0013484295],"about_ca_topic_score_codex":0.000021698092,"about_ca_topic_score_gemma":0.00004002443,"teacher_disagreement_score":0.5192391,"about_ca_system_score_codex":0.00006683562,"about_ca_system_score_gemma":0.00012434769,"threshold_uncertainty_score":0.6930878},"labels":[],"label_agreement":null},{"id":"W6967082722","doi":"10.4230/lipics.disc.2019.0","title":"Front Matter, Table of Contents, Preface, Conference Organization","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Diverse Scientific and Economic Studies","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Háskólinn í Reykjavík; Institute of Science and Technology Austria; Université Paris-Sud; Sorbonne Université; University of Waterloo; Szegedi Tudományegyetem; Augusta University; École Polytechnique Fédérale de Lausanne; Universität Hamburg; King's College London; Universität Salzburg; Helsingin Yliopisto; Ben-Gurion University of the Negev; Université Paris Diderot","keywords":"Table (database); Front (military); Table of contents; Front office; Front and back ends","score_opus":0.023233327862266905,"score_gpt":0.19375407058889021,"score_spread":0.17052074272662332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6967082722","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5063136,0.00026435914,0.008479653,0.00018638161,0.0051790127,0.0017576136,0.0077348785,0.000088605164,0.4699959],"genre_scores_gemma":[0.88934714,0.000103252656,0.0013441291,0.00041251312,0.000040320057,0.000029756022,0.00042819712,0.000036644742,0.108258046],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979719,0.0000054778156,0.0012292506,0.00028835,0.00007118592,0.0004338318],"domain_scores_gemma":[0.99830616,0.000034661654,0.0008505425,0.0004913738,0.00023074338,0.000086513384],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000377496,0.00023107699,0.0006441811,0.00021586349,0.00012645921,0.00016613606,0.00046130788,0.00013059675,0.0153831765],"category_scores_gemma":[0.00006572677,0.00024506386,0.00012436288,0.00017673566,0.00010475736,0.0009847876,0.00022999942,0.00012324059,0.03515528],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008745246,0.00037248794,0.60803586,0.0009413015,0.00048984797,4.2976765e-7,0.009700952,0.0002268823,0.00007682623,0.077741385,0.3020502,0.00027637774],"study_design_scores_gemma":[0.007436829,0.00027038655,0.028683787,0.00022834865,0.00005209753,0.00000977516,0.0085085165,0.013672326,0.001424442,0.0027537823,0.93573314,0.0012265692],"about_ca_topic_score_codex":0.00007440827,"about_ca_topic_score_gemma":0.0000056076487,"teacher_disagreement_score":0.63368297,"about_ca_system_score_codex":0.0001044467,"about_ca_system_score_gemma":0.00002414795,"threshold_uncertainty_score":0.99934137},"labels":[],"label_agreement":null},{"id":"W6967083426","doi":"10.4230/lipics.ecoop.2020.3","title":"Blame for Null","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Blame; Java; Type (biology); Slogan; Semantics (computer science); Calculus (dental)","score_opus":0.030360240855390904,"score_gpt":0.25382819809362883,"score_spread":0.22346795723823792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6967083426","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025701327,0.00008338492,0.98540175,0.0017347316,0.001335597,0.0019679114,0.00009635124,0.00053248054,0.006277664],"genre_scores_gemma":[0.947018,0.000012167368,0.046228394,0.004950271,0.0006197605,0.00035824702,0.00022832546,0.000052068764,0.00053276384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973422,0.000027943219,0.0009835492,0.00037392735,0.00042636535,0.00084598747],"domain_scores_gemma":[0.9980739,0.00013976295,0.00042337156,0.000693961,0.00030128402,0.0003677291],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048287865,0.0003759067,0.00049305026,0.000113224094,0.00032476033,0.00067536463,0.0016762568,0.00021314662,0.00001676841],"category_scores_gemma":[0.00015967355,0.00031892434,0.00036673577,0.000340141,0.000078950034,0.0014058504,0.00041778534,0.00025477645,0.0003740079],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019869846,0.00041231894,0.0033827017,0.002582911,0.0003919131,0.000013398824,0.042616725,0.00013306091,0.00015228553,0.81703526,0.06669745,0.06638329],"study_design_scores_gemma":[0.0031182398,0.00079611887,0.00009742118,0.000019862755,0.00003181106,0.00003436899,0.00075115706,0.1336914,0.0009922483,0.00692191,0.85290253,0.0006429317],"about_ca_topic_score_codex":0.000010593748,"about_ca_topic_score_gemma":0.000006238577,"teacher_disagreement_score":0.9444479,"about_ca_system_score_codex":0.00006697728,"about_ca_system_score_gemma":0.00009425327,"threshold_uncertainty_score":0.99992627},"labels":[],"label_agreement":null},{"id":"W6967393897","doi":"10.4230/lipics.approx/random.2024.36","title":"On the Houdré-Tetali Conjecture About an Isoperimetric Constant of Graphs","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Isoperimetric inequality; Conjecture; Counterexample; Constant (computer programming); Logarithm; Eigenvalues and eigenvectors","score_opus":0.038046834047651995,"score_gpt":0.3205532384181279,"score_spread":0.2825064043704759,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6967393897","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9711621,0.00026552912,0.0066969274,0.00043619674,0.00058261724,0.0021141223,0.0020288655,0.0003347984,0.016378881],"genre_scores_gemma":[0.9966993,0.000042567783,0.0020488235,0.0004957032,0.000055907723,0.00020361278,0.00017293295,0.000064204694,0.00021698674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976916,0.0000783018,0.0010649737,0.00024896045,0.0004334412,0.00048275138],"domain_scores_gemma":[0.9970312,0.0013301413,0.00032269617,0.0009916311,0.00017864343,0.00014565547],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000979643,0.0003954062,0.0004716132,0.00044400682,0.0003543526,0.00024973112,0.0007209658,0.00021637374,0.00028396494],"category_scores_gemma":[0.0002663666,0.0002538551,0.00041018592,0.0009514685,0.0003951003,0.00044728394,0.00010380567,0.0005158419,0.00009846505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053307216,0.0002881761,0.00009038512,0.0006722932,0.0002254746,0.0000020023242,0.004293298,0.000009417592,0.00019126914,0.98663414,0.0058518597,0.001688359],"study_design_scores_gemma":[0.0012362663,0.00061744195,0.000096792726,0.0005884569,0.00025448616,0.000067945635,0.0036780194,0.0056935507,0.007640453,0.9434198,0.036086675,0.00062007393],"about_ca_topic_score_codex":0.0000056515732,"about_ca_topic_score_gemma":0.000007370859,"teacher_disagreement_score":0.043214317,"about_ca_system_score_codex":0.000043551598,"about_ca_system_score_gemma":0.00007453736,"threshold_uncertainty_score":0.99999136},"labels":[],"label_agreement":null},{"id":"W6967458180","doi":"10.4230/lipics.approx/random.2023.14","title":"Algorithms for 2-Connected Network Design and Flexible Steiner Trees with a Constant Number of Terminals","year":2023,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; European Commission","keywords":"Steiner tree problem; Partition (number theory); Constant (computer programming); Randomized algorithm; Generalization; Approximation algorithm; Graph; Set (abstract data type); Network planning and design; Undirected graph","score_opus":0.0399989508806633,"score_gpt":0.2908798143270963,"score_spread":0.250880863446433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6967458180","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029194694,0.000047194244,0.966928,0.00025501958,0.000421904,0.0018369018,0.00034035405,0.0004011286,0.0005748206],"genre_scores_gemma":[0.11016947,0.00007754318,0.88769215,0.00049531186,0.00018901358,0.0005052547,0.00022884276,0.00006438763,0.0005779997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99735767,0.000052279524,0.0009390584,0.0003591136,0.00042595292,0.0008659225],"domain_scores_gemma":[0.99750507,0.0007907628,0.0004503472,0.00067860476,0.00038444065,0.00019075452],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009490837,0.00039397637,0.0006268443,0.00025704887,0.00038987308,0.00031633847,0.0008700575,0.00015138449,0.000012455983],"category_scores_gemma":[0.00006807434,0.00031785207,0.0001807335,0.001020004,0.00029514442,0.0010466304,0.0003834827,0.0001986859,0.000017680804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002629388,0.0015188414,0.018947458,0.0054078586,0.0027917644,0.00009881083,0.0378343,0.01871203,0.00038616615,0.5148927,0.05764626,0.3391344],"study_design_scores_gemma":[0.005837636,0.0011439287,0.0008744319,0.0005552626,0.0000868662,0.00021643845,0.0009099095,0.9455326,0.0016570997,0.023296759,0.019027498,0.00086154393],"about_ca_topic_score_codex":0.000012024392,"about_ca_topic_score_gemma":0.000010502498,"teacher_disagreement_score":0.9268206,"about_ca_system_score_codex":0.00003228383,"about_ca_system_score_gemma":0.00011606295,"threshold_uncertainty_score":0.99992734},"labels":[],"label_agreement":null},{"id":"W7076650340","doi":"10.4230/lipics.dna.31.2","title":"A Coupled Reconfiguration Mechanism That Enables Powerful, Pseudoknot-Robust DNA Strand Displacement Devices with 2-Stranded Inputs","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Geochemistry and Geologic Mapping","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"DNA; Control reconfiguration; Set (abstract data type); Abstraction; Displacement (psychology); Mechanism (biology); Double strand; DNA computing","score_opus":0.014497686267377193,"score_gpt":0.22739219413989512,"score_spread":0.21289450787251793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7076650340","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.120919906,0.000033850312,0.85368836,0.004198297,0.00067078555,0.001649979,0.00010650911,0.0003089729,0.01842333],"genre_scores_gemma":[0.98165923,0.00002762887,0.014198308,0.0013116137,0.00004483984,0.00013850193,0.00032537075,0.000010650286,0.002283839],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973813,0.000041054056,0.00086981687,0.00045506272,0.0004891748,0.0007635743],"domain_scores_gemma":[0.9980551,0.0001370318,0.0004740907,0.0008045503,0.00036173398,0.00016749985],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066760683,0.0004875273,0.0004990431,0.00021685526,0.00046906504,0.00072869007,0.0011263404,0.00025695693,0.00005715185],"category_scores_gemma":[0.000057527486,0.00039100228,0.00015535344,0.00039374176,0.0000874798,0.0015888239,0.00024229461,0.00033178326,0.00002858904],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.007437585,0.0067319986,0.04019476,0.03342713,0.008203279,0.00027317542,0.09814335,0.02990626,0.02616332,0.6447235,0.061503388,0.043292273],"study_design_scores_gemma":[0.023238594,0.0014866621,0.0023078723,0.002631693,0.0003611076,0.00026201495,0.007965818,0.6747,0.14220466,0.016793419,0.1250028,0.0030453154],"about_ca_topic_score_codex":0.000015910555,"about_ca_topic_score_gemma":0.000083417064,"teacher_disagreement_score":0.86073935,"about_ca_system_score_codex":0.00010439111,"about_ca_system_score_gemma":0.00018930645,"threshold_uncertainty_score":0.9998542},"labels":[],"label_agreement":null},{"id":"W7078732059","doi":"10.4230/lipics.wads.2025.23","title":"Novel Complexity Results for Temporal Separators with Deadlines","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Geochemistry and Geologic Mapping","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Bounded function; Vertex (graph theory); Separator (oil production); Time complexity; Dominating set; Treewidth; Pathwidth","score_opus":0.03046444565270152,"score_gpt":0.27609433348599827,"score_spread":0.24562988783329676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7078732059","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022236219,0.000019164025,0.9486741,0.004232214,0.0006475846,0.0014524327,0.0007157798,0.00033041817,0.021692082],"genre_scores_gemma":[0.6870366,0.0000037157063,0.30532402,0.0021372766,0.00014055792,0.00029855713,0.0008872419,0.000012420651,0.004159649],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99757946,0.00001588729,0.0009902016,0.0004103375,0.00029024546,0.00071390165],"domain_scores_gemma":[0.9976058,0.00024338912,0.0004282748,0.00094647927,0.00063005404,0.00014601192],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006749818,0.00038388904,0.00045620857,0.0001674021,0.0004897431,0.0003544498,0.0015878391,0.00020167122,0.000003659235],"category_scores_gemma":[0.00027067016,0.0003081165,0.00018958586,0.0004936046,0.00018976173,0.0008501445,0.0004971767,0.0002573377,0.000014148821],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004505922,0.0030119778,0.038992405,0.009154944,0.0017749418,0.00002387472,0.020882478,0.0063283383,0.0011424215,0.6386941,0.254988,0.020500591],"study_design_scores_gemma":[0.010101031,0.00046745525,0.0015598994,0.0003752722,0.000054239215,0.00006660342,0.00085474807,0.2557015,0.0057222676,0.009084623,0.7151253,0.0008870041],"about_ca_topic_score_codex":0.000024295814,"about_ca_topic_score_gemma":0.00004909462,"teacher_disagreement_score":0.66480035,"about_ca_system_score_codex":0.00006988293,"about_ca_system_score_gemma":0.00018983397,"threshold_uncertainty_score":0.9999371},"labels":[],"label_agreement":null},{"id":"W7078734648","doi":"10.4230/lipics.wads.2025.35","title":"Succinct Data Structures for Chordal Graph with Bounded Leafage or Vertex Leafage","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Geochemistry and Geologic Mapping","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Chordal graph; Bounded function; Vertex (graph theory); Interval graph; Upper and lower bounds; Treewidth; Graph","score_opus":0.026244362606584568,"score_gpt":0.277984685696413,"score_spread":0.2517403230898284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7078734648","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03749998,0.00011168082,0.9335878,0.0038542217,0.001692148,0.0029276689,0.0013581215,0.00059556734,0.018372806],"genre_scores_gemma":[0.8770744,0.00003542795,0.1097849,0.0031916562,0.00018448841,0.00029919215,0.0024128489,0.000030841533,0.0069862218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969091,0.000032994685,0.00095010974,0.0006706677,0.0004247935,0.001012364],"domain_scores_gemma":[0.99621004,0.00035022612,0.00039717706,0.0024781257,0.00037907885,0.00018532737],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006850981,0.00053846376,0.0005954602,0.00025565588,0.00074099656,0.0007867773,0.003859955,0.00027459953,0.000045964163],"category_scores_gemma":[0.0003808111,0.0003933169,0.00017945495,0.0006505131,0.00020430436,0.0019254261,0.0013196641,0.0004301039,0.000015084158],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0049948846,0.0015833607,0.020379484,0.013854652,0.0033592228,0.00011838656,0.01504564,0.0016803497,0.00069879915,0.44459933,0.39967364,0.09401225],"study_design_scores_gemma":[0.009264912,0.0007275355,0.0020571807,0.00041797943,0.00015980712,0.00016635451,0.0014973225,0.12843433,0.0038739827,0.026634261,0.82544315,0.0013231668],"about_ca_topic_score_codex":0.000026778665,"about_ca_topic_score_gemma":0.00010815992,"teacher_disagreement_score":0.83957446,"about_ca_system_score_codex":0.00007601672,"about_ca_system_score_gemma":0.0003153214,"threshold_uncertainty_score":0.9998519},"labels":[],"label_agreement":null},{"id":"W7081624911","doi":"10.4230/lipics.approx/random.2025.29","title":"A Simplified Reduction for Error Correcting Matrix Multiplication Algorithms","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Geochemistry and Geologic Mapping","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Matrix multiplication; Matrix (chemical analysis); Reduction (mathematics); Fraction (chemistry); Simple (philosophy); DFT matrix; Prime (order theory); Product (mathematics); Multiplication (music)","score_opus":0.019861532557185178,"score_gpt":0.3007861290329098,"score_spread":0.2809245964757246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7081624911","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015529439,0.00003094977,0.9733793,0.0023948385,0.0017612341,0.0016922537,0.00008922175,0.00039023493,0.0047325217],"genre_scores_gemma":[0.80426866,0.000008959329,0.18736084,0.0006541738,0.00026273463,0.00084543944,0.0005168648,0.000014989367,0.00606732],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978528,0.00002285605,0.00091094215,0.00038475642,0.00021559335,0.0006130661],"domain_scores_gemma":[0.9979077,0.00022146445,0.0004503149,0.00076516106,0.0005524304,0.00010291319],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069727434,0.0002989899,0.00033227835,0.00020594957,0.00058185105,0.00032311777,0.00095082633,0.00024740584,0.000006825327],"category_scores_gemma":[0.0004230173,0.00029169046,0.00022505749,0.0004792712,0.000062130195,0.0009319047,0.00032710328,0.00026862483,0.000025346159],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00078864204,0.0016301286,0.0042226566,0.008088964,0.0009777951,0.0000051707975,0.03653947,0.0124636525,0.010129261,0.12903011,0.09140111,0.70472306],"study_design_scores_gemma":[0.00287474,0.00013854605,0.0002750121,0.00020012929,0.00004435536,0.00007746756,0.0022332424,0.79951304,0.018263856,0.007901829,0.16794437,0.0005334327],"about_ca_topic_score_codex":0.00001244806,"about_ca_topic_score_gemma":0.0000027721942,"teacher_disagreement_score":0.78873926,"about_ca_system_score_codex":0.00012867471,"about_ca_system_score_gemma":0.000099574434,"threshold_uncertainty_score":0.9999535},"labels":[],"label_agreement":null},{"id":"W7081631891","doi":"10.4230/lipics.approx/random.2025.58","title":"Equality Is Far Weaker Than Constant-Cost Communication","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Geochemistry and Geologic Mapping","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Protocol (science); Communications protocol; Randomized response; Randomized algorithm; Key (lock)","score_opus":0.02211886976845145,"score_gpt":0.2782121212068231,"score_spread":0.25609325143837164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7081631891","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016587885,0.00021396446,0.6519514,0.01690499,0.0009796786,0.0017774919,0.00040412863,0.0005668777,0.3106136],"genre_scores_gemma":[0.96846473,0.00008493498,0.019437028,0.005991541,0.00003605406,0.00016280773,0.0003272179,0.000007856418,0.00548784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976697,0.00006997278,0.0009987577,0.00030398183,0.00032295298,0.00063465914],"domain_scores_gemma":[0.99703914,0.00022859231,0.0003974209,0.001761052,0.0004413953,0.00013240105],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00096613634,0.00032465404,0.00038505014,0.00014498613,0.00055809785,0.00043681887,0.0020436815,0.00025393034,0.000059083344],"category_scores_gemma":[0.00019422849,0.0003021643,0.00021431678,0.0004740997,0.00019536591,0.0010672846,0.0010257828,0.00043409903,0.000119301025],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013071085,0.00071350625,0.025823439,0.0018555924,0.0004989611,0.0000049524397,0.02368014,0.00020736983,0.00033945497,0.8109299,0.08828854,0.04752742],"study_design_scores_gemma":[0.002211378,0.000059193182,0.0014737366,0.0002788674,0.000033282708,0.000025639654,0.0016198995,0.07130512,0.004528299,0.025409617,0.89246976,0.00058520853],"about_ca_topic_score_codex":0.000035680256,"about_ca_topic_score_gemma":0.00002253729,"teacher_disagreement_score":0.9518768,"about_ca_system_score_codex":0.00009980719,"about_ca_system_score_gemma":0.00013280087,"threshold_uncertainty_score":0.999943},"labels":[],"label_agreement":null},{"id":"W7081637209","doi":"10.4230/lipics.approx/random.2025.14","title":"Improved Lower Bounds on Multiflow-Multicut Gaps","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Geochemistry and Geologic Mapping","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Upper and lower bounds; Class (philosophy); Planar; Set (abstract data type); Value (mathematics); Maximum flow problem","score_opus":0.008668657313475093,"score_gpt":0.2444832486576264,"score_spread":0.2358145913441513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7081637209","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15818408,0.00012448205,0.6003282,0.009991535,0.008619076,0.0035076726,0.00035452397,0.0015659998,0.2173244],"genre_scores_gemma":[0.9588794,0.000017056642,0.02526173,0.0047200792,0.00014483296,0.00019771316,0.00016917645,0.000014369724,0.010595649],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99724936,0.00003177052,0.0009841361,0.00045872873,0.00034987464,0.00092611514],"domain_scores_gemma":[0.997496,0.00024535347,0.0003160643,0.0013565179,0.00039233227,0.00019373729],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000554084,0.00046841663,0.00045190981,0.00024397597,0.00050373946,0.00055931706,0.0017470475,0.00032081013,0.000041956788],"category_scores_gemma":[0.00038150986,0.00041239714,0.000310925,0.00047888173,0.00013314586,0.0009094152,0.00069692265,0.0005242387,0.00015224463],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024218683,0.008693903,0.019115813,0.011331512,0.002937993,0.00017005223,0.04145337,0.0065762294,0.015400084,0.3660468,0.2817351,0.2441173],"study_design_scores_gemma":[0.0042931624,0.0003477372,0.0007464797,0.00036040676,0.00003652486,0.000024769637,0.00047140656,0.42378727,0.013036966,0.002949569,0.5531192,0.00082653406],"about_ca_topic_score_codex":0.000013244954,"about_ca_topic_score_gemma":0.000008326834,"teacher_disagreement_score":0.8006953,"about_ca_system_score_codex":0.00013592775,"about_ca_system_score_gemma":0.00013239564,"threshold_uncertainty_score":0.9998328},"labels":[],"label_agreement":null},{"id":"W7082444139","doi":"10.4230/oasics.spacechi.2025.20","title":"Navigating Exoplanetary Systems in Augmented Reality: Preliminary Insights on ExoAR","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Geochemistry and Geologic Mapping","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Exoplanet; Visualization; Curiosity; Limiting; Space exploration; Data visualization; Kepler; Augmented reality","score_opus":0.01646173903099922,"score_gpt":0.26373281318009184,"score_spread":0.2472710741490926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7082444139","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73826265,0.0007978793,0.13451092,0.0067312303,0.004886493,0.0049902145,0.00029606879,0.0011788129,0.108345754],"genre_scores_gemma":[0.994642,0.000025844496,0.0026571448,0.0012090539,0.00007330058,0.00018417816,0.00046654415,0.000008396082,0.0007334972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99716365,0.00008361359,0.0012375282,0.00042233622,0.00039091162,0.00070194196],"domain_scores_gemma":[0.99798596,0.00030858867,0.00038052705,0.0010143094,0.00017967056,0.00013095817],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000644145,0.00039681437,0.0004927404,0.00017703469,0.0003044377,0.00031172365,0.0012877203,0.00028630032,0.0000064286114],"category_scores_gemma":[0.00017554339,0.00036040772,0.00013187971,0.0005995246,0.000079823396,0.0008511918,0.0005410484,0.0007331343,0.00004821112],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024289961,0.0055039716,0.05929049,0.030277263,0.0017532078,0.0008377989,0.1106822,0.11841083,0.0016370192,0.3659851,0.090036385,0.21315674],"study_design_scores_gemma":[0.004431942,0.0006012717,0.004543638,0.0040231394,0.000035778143,0.00010682337,0.0034383982,0.8175425,0.0024670034,0.0044203363,0.15736768,0.001021521],"about_ca_topic_score_codex":0.000097266566,"about_ca_topic_score_gemma":0.00001437429,"teacher_disagreement_score":0.69913167,"about_ca_system_score_codex":0.00015301086,"about_ca_system_score_gemma":0.0000904875,"threshold_uncertainty_score":0.9998848},"labels":[],"label_agreement":null},{"id":"W7084387776","doi":"10.4230/artifacts.24666","title":"KaMinPar","year":2025,"lang":"en","type":"other","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Bacterial Genetics and Biotechnology","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Disjoint sets; Partition (number theory); Speedup; Graph; Graph partition","score_opus":0.005440651133032692,"score_gpt":0.23423479217040824,"score_spread":0.22879414103737555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7084387776","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071487213,0.0018197048,0.010320652,0.0005718908,0.005683841,0.0035151094,0.010293909,0.00045431912,0.96019185],"genre_scores_gemma":[0.015245389,0.003063896,0.013058972,0.0027521537,0.0023467983,0.00034980456,0.014586538,0.0008972439,0.9476992],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979425,0.000023586243,0.00072513643,0.00043519982,0.00019752781,0.0006760555],"domain_scores_gemma":[0.9981843,0.000010940591,0.00046336657,0.0010806356,0.00013262774,0.00012807945],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0001657346,0.00060587283,0.0005733881,0.00032103926,0.00010657369,0.00010734716,0.0008571394,0.0019420177,0.00030409585],"category_scores_gemma":[0.0000726885,0.000567426,0.00033422458,0.00014157205,0.00019526244,0.000005680996,0.0005673057,0.00036276074,0.00015913937],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013018136,0.00019375449,0.00017428507,0.0007969113,0.00063660444,0.000002550922,0.00006288851,0.0000027166955,0.007112048,0.0011814306,0.9771579,0.012548754],"study_design_scores_gemma":[0.0013967863,0.0003250679,0.000024611574,0.00017637541,0.00008167175,0.00001452601,0.00006479756,0.000057876503,0.014865199,0.00008342241,0.9822992,0.00061048096],"about_ca_topic_score_codex":0.00002779391,"about_ca_topic_score_gemma":0.00010013702,"teacher_disagreement_score":0.012492646,"about_ca_system_score_codex":0.00003104096,"about_ca_system_score_gemma":0.0001842531,"threshold_uncertainty_score":0.9996777},"labels":[],"label_agreement":null},{"id":"W7084402895","doi":"10.4230/lipics.esa.2025.38","title":"Tight Guarantees for Cut-Relative Survivable Network Design via a Decomposition Technique","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Plasmonic and Surface Plasmon Research","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tuple; Function (biology); Graph; Enhanced Data Rates for GSM Evolution; Undirected graph; Decomposition; Topology (electrical circuits); Connectivity","score_opus":0.01396891266407011,"score_gpt":0.271548692569085,"score_spread":0.25757977990501485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7084402895","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009642895,0.00018180085,0.976602,0.00010589647,0.00063825934,0.0034812686,0.00039976745,0.00045979657,0.008488322],"genre_scores_gemma":[0.53321844,0.00025875552,0.45995915,0.0003702833,0.000081565144,0.0030426793,0.0011524659,0.00015615836,0.0017605426],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974546,0.000052731397,0.00092810177,0.00022796323,0.00030308208,0.0010335613],"domain_scores_gemma":[0.9982792,0.00076777296,0.00012514426,0.00042593823,0.00026520583,0.00013673124],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010173959,0.0004342767,0.00055418105,0.00030412676,0.00042704615,0.00019615205,0.00052484876,0.0003820045,0.000033030537],"category_scores_gemma":[0.00007433375,0.0004157236,0.0002635356,0.00048197922,0.00009308484,0.00088307186,0.00011713589,0.000513995,0.00006761195],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025121055,0.00073964964,0.0033995227,0.0068014134,0.0035635626,0.000018624509,0.0051813605,0.71394,0.005163935,0.040258285,0.2060134,0.012408109],"study_design_scores_gemma":[0.00216364,0.00020342931,0.00008658312,0.00042163057,0.000071130075,0.000014471473,0.00021336375,0.9120043,0.0152343875,0.0053867023,0.06366719,0.0005331654],"about_ca_topic_score_codex":0.000012378109,"about_ca_topic_score_gemma":0.00002437561,"teacher_disagreement_score":0.52357554,"about_ca_system_score_codex":0.0002709369,"about_ca_system_score_gemma":0.000092431554,"threshold_uncertainty_score":0.9998295},"labels":[],"label_agreement":null},{"id":"W7106788651","doi":"10.4230/lipics.gd.2025","title":"LIPIcs, Volume 357, GD 2025, Complete Volume","year":2025,"lang":"en","type":"other","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"","score_opus":0.018163559139602464,"score_gpt":0.2640134278780731,"score_spread":0.24584986873847062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7106788651","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015534915,0.0007846452,0.014465844,0.00044937758,0.0074608596,0.0069909943,0.08350008,0.0033368878,0.88285595],"genre_scores_gemma":[0.0010684807,0.0002012165,0.013315508,0.002189916,0.0019774497,0.000686767,0.023079453,0.0033844272,0.9540968],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9894813,0.00018795411,0.0038493152,0.0012714099,0.0020190056,0.0031910408],"domain_scores_gemma":[0.991117,0.00019297986,0.003056107,0.0038580769,0.00091576274,0.00086005393],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"category_scores_codex":[0.0011793328,0.0027157948,0.0031538676,0.002791072,0.00065238395,0.0011249926,0.003820828,0.0023541863,0.011516671],"category_scores_gemma":[0.00048653717,0.0028212313,0.0016047757,0.0013187567,0.00083223643,0.0011898609,0.0017615131,0.0024485504,0.07206889],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020794904,0.00051210035,0.0029388708,0.0038093901,0.0014087963,0.000018881587,0.0012600485,0.000035120946,0.0000118041435,0.0023921016,0.98482656,0.002578389],"study_design_scores_gemma":[0.0054196944,0.0002814677,0.0002886868,0.0018732729,0.00063887803,0.00004611602,0.0006132658,0.012123163,0.000020670299,0.00026478063,0.975762,0.002667991],"about_ca_topic_score_codex":0.00064026326,"about_ca_topic_score_gemma":0.0006344881,"teacher_disagreement_score":0.07124082,"about_ca_system_score_codex":0.0010766399,"about_ca_system_score_gemma":0.00082540634,"threshold_uncertainty_score":0.99991196},"labels":[],"label_agreement":null},{"id":"W7106804950","doi":"10.4230/lipics.gd.2025.34","title":"Layered Polyline Drawings of Planar Graphs","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Embedding; Planar; Book embedding; Planar graph; Planar straight-line graph; Graph; Vertex (graph theory); Outerplanar graph","score_opus":0.00862720144262005,"score_gpt":0.2555538395783557,"score_spread":0.24692663813573565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7106804950","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078226954,0.0001019067,0.9139765,0.0008214704,0.0010680694,0.0005769485,0.00015646085,0.00014209945,0.004929598],"genre_scores_gemma":[0.91159356,0.000023998207,0.0855373,0.0016294261,0.00006488505,0.000047658166,0.0003350622,0.000012136424,0.0007559484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980985,0.000025852944,0.00092353066,0.00021638384,0.00036597822,0.0003697324],"domain_scores_gemma":[0.9985339,0.00016640416,0.00032433105,0.00052693154,0.00035347234,0.00009495932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043192974,0.00022938402,0.00032996605,0.00057908305,0.00022221253,0.00018184051,0.00087721186,0.00012958702,0.00001033407],"category_scores_gemma":[0.00008753609,0.00021783047,0.00020347502,0.0009060653,0.0000647767,0.0010166367,0.0002145218,0.00017796838,0.000022800357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016531654,0.00056395895,0.0043159053,0.00093326153,0.00037906802,0.0000037818827,0.0056675696,0.003073848,0.0014452972,0.90529114,0.022068404,0.05609247],"study_design_scores_gemma":[0.009832056,0.00081657834,0.010133619,0.00061526144,0.000115685376,0.00006672939,0.0008931234,0.610821,0.03838949,0.09002932,0.23687802,0.0014091212],"about_ca_topic_score_codex":0.000014304536,"about_ca_topic_score_gemma":0.0000083939085,"teacher_disagreement_score":0.83336663,"about_ca_system_score_codex":0.00004810534,"about_ca_system_score_gemma":0.00014514531,"threshold_uncertainty_score":0.8882869},"labels":[],"label_agreement":null},{"id":"W7106806343","doi":"10.4230/lipics.gd.2025.0","title":"Front Matter, Table of Contents, Preface, Conference Organization","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Diverse Scientific and Economic Studies","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Table (database); Front (military); Table of contents; Front office; Front and back ends","score_opus":0.02358150356367914,"score_gpt":0.20934650921269696,"score_spread":0.18576500564901782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7106806343","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12796347,0.00059976947,0.050850704,0.0005265355,0.0063622613,0.0017599084,0.009234457,0.00012318468,0.8025797],"genre_scores_gemma":[0.8216227,0.00020157889,0.0021334016,0.0008867377,0.000040248407,0.000060961396,0.00046678152,0.00003067046,0.17455687],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99797803,0.0000058306373,0.0012942086,0.00027004504,0.000053624008,0.00039823493],"domain_scores_gemma":[0.9985236,0.00004020781,0.0006711831,0.000440893,0.00025798552,0.00006611052],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00037401222,0.00022109228,0.00060801936,0.00030800336,0.00020428344,0.00018038535,0.00046963492,0.00013115538,0.0049838126],"category_scores_gemma":[0.00012265833,0.00023885808,0.00011954679,0.0002676833,0.00015029672,0.0007389924,0.00026092588,0.00012067951,0.0064299502],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069333364,0.00034135257,0.23037113,0.0008393615,0.0005449013,3.8972726e-7,0.0053862846,0.000121189165,0.000030500889,0.16389242,0.59793705,0.00046608408],"study_design_scores_gemma":[0.005038323,0.00010289604,0.018453043,0.00026081403,0.00006377734,0.0000033340887,0.0058119087,0.0083378805,0.0013565553,0.0058465097,0.9539783,0.0007466624],"about_ca_topic_score_codex":0.000086005544,"about_ca_topic_score_gemma":0.000010216755,"teacher_disagreement_score":0.6936593,"about_ca_system_score_codex":0.0001215861,"about_ca_system_score_gemma":0.000035972862,"threshold_uncertainty_score":0.9959258},"labels":[],"label_agreement":null},{"id":"W7107853480","doi":"10.4230/lipics.isaac.2025.49","title":"Maximizing Social Welfare Among EF1 Allocations at the Presence of Two Types of Agents","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"China Scholarship Council; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Constant (computer programming); Expected utility hypothesis; Function (biology); Social Welfare; Social welfare function; Transferable utility","score_opus":0.027448889132929914,"score_gpt":0.2640014466067061,"score_spread":0.23655255747377618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7107853480","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9532418,0.00017181186,0.0058806324,0.0007230641,0.0008498721,0.00086659606,0.0011210975,0.000037026286,0.0371081],"genre_scores_gemma":[0.99730897,0.000011890904,0.0002762117,0.000108092565,0.000040833133,0.00005575652,0.000096003365,0.000015777914,0.002086464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99815226,0.000028443945,0.0012912342,0.00015164104,0.00007703603,0.00029936622],"domain_scores_gemma":[0.99832857,0.00013903792,0.0009458884,0.00042214885,0.00012800649,0.000036335317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009322061,0.0001705566,0.00045418684,0.00020035528,0.00037932655,0.000056275105,0.000556335,0.00011122591,0.000105339146],"category_scores_gemma":[0.00018498288,0.0001529912,0.000223919,0.00029080876,0.00023173059,0.00032928464,0.00023507114,0.00015824822,0.000044675813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008317524,0.00018284703,0.168756,0.001249993,0.00041592336,2.8895153e-7,0.013771701,0.00085255597,0.000027310529,0.8108015,0.0029556055,0.0009030794],"study_design_scores_gemma":[0.016546741,0.00054917013,0.305849,0.0017661132,0.00044103124,0.000022311076,0.024130192,0.11535066,0.00866758,0.07842341,0.445767,0.0024868082],"about_ca_topic_score_codex":0.00011424684,"about_ca_topic_score_gemma":0.00006108318,"teacher_disagreement_score":0.7323781,"about_ca_system_score_codex":0.00007767342,"about_ca_system_score_gemma":0.00001999973,"threshold_uncertainty_score":0.62387997},"labels":[],"label_agreement":null},{"id":"W7109943489","doi":"10.4230/lipics.disc.2025.3","title":"An Almost-Logarithmic Lower Bound for Leader Election with Bounded Value Contention","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund; Nvidia","keywords":"Upper and lower bounds; Bounded function; Asynchronous communication; Communication complexity; Binary logarithm; Value (mathematics); Leader election; Key (lock); Time complexity","score_opus":0.010093199235443285,"score_gpt":0.2679484564725383,"score_spread":0.257855257237095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7109943489","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07868365,0.000047931673,0.9141892,0.0006714544,0.0018349264,0.002144254,0.00030772944,0.00029935592,0.0018214677],"genre_scores_gemma":[0.9701849,0.000008508502,0.024418702,0.0020279186,0.00014538915,0.0006274515,0.00075454864,0.000038784052,0.0017937621],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99733996,0.00003568371,0.0009655754,0.00045352578,0.0004160616,0.000789198],"domain_scores_gemma":[0.9977394,0.000087329856,0.00041442295,0.0008991706,0.000699952,0.00015973065],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00064697687,0.00040311727,0.00048242323,0.00027194864,0.0006961886,0.0012647078,0.0010205759,0.00025582168,0.0000049986584],"category_scores_gemma":[0.000047306305,0.00034349452,0.00022446031,0.0005653526,0.00013001265,0.0028871442,0.00010265168,0.00028587494,0.00002476899],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032347774,0.0044347597,0.008706571,0.004535452,0.0021209982,0.00002618442,0.014470006,0.0023736262,0.0034214072,0.7562157,0.0747636,0.12569693],"study_design_scores_gemma":[0.011463557,0.0020873996,0.0018006833,0.0006675462,0.00011789524,0.000113737944,0.0015440705,0.6037809,0.0038937803,0.005482049,0.36786482,0.0011835573],"about_ca_topic_score_codex":0.00005777849,"about_ca_topic_score_gemma":0.00008917235,"teacher_disagreement_score":0.8915013,"about_ca_system_score_codex":0.00023976939,"about_ca_system_score_gemma":0.00021672416,"threshold_uncertainty_score":0.9999017},"labels":[],"label_agreement":null},{"id":"W7109950510","doi":"10.4230/lipics.icalp.2025.28","title":"Faster & Deterministic FPT Algorithm for Worst-Case Tensor Decomposition","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Tensor (intrinsic definition); Decomposition; Deterministic algorithm; Rank (graph theory); Cluster analysis; Time complexity; State (computer science); Randomized algorithm","score_opus":0.015887207734168993,"score_gpt":0.2990740121710311,"score_spread":0.28318680443686206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7109950510","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008846043,0.000048412254,0.9837723,0.00050402666,0.0021774431,0.0018002425,0.0007084556,0.00033848887,0.0018046015],"genre_scores_gemma":[0.1490587,0.000020583566,0.84421414,0.0039454172,0.00031991003,0.000788522,0.0004569105,0.000056259752,0.0011395536],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99688506,0.000047746533,0.0012717212,0.00049208454,0.00035863623,0.0009447469],"domain_scores_gemma":[0.99735945,0.0005145998,0.0003722218,0.0010793826,0.0004526972,0.00022162328],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005762505,0.00050672545,0.0005678348,0.00057786796,0.0008930588,0.00089947367,0.0014250617,0.0002475797,0.000016382828],"category_scores_gemma":[0.00008719592,0.00048567032,0.00048022083,0.0006099653,0.0001726888,0.0015355151,0.00061645394,0.00036187097,0.00005856081],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000119906974,0.00073691964,0.0003786277,0.0010306942,0.0003939326,0.00012960842,0.0043661203,0.00012092341,0.0000396321,0.05612098,0.009024254,0.9275384],"study_design_scores_gemma":[0.0036646756,0.00041258935,0.00017008526,0.00027648517,0.0000908109,0.0007620385,0.0005162042,0.91061294,0.00066644093,0.013443052,0.06867341,0.0007112853],"about_ca_topic_score_codex":0.000011134304,"about_ca_topic_score_gemma":0.000018627468,"teacher_disagreement_score":0.92682713,"about_ca_system_score_codex":0.00014122284,"about_ca_system_score_gemma":0.00011733989,"threshold_uncertainty_score":0.9997595},"labels":[],"label_agreement":null},{"id":"W7109951950","doi":"10.4230/lipics.socg.2025.63","title":"The Maximum Clique Problem in a Disk Graph Made Easy","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Clique graph; Block graph; Unit disk graph; Split graph; Clique problem; Perfect graph; Circle graph; Independent set; Time complexity","score_opus":0.0075087614687796905,"score_gpt":0.25114617129617944,"score_spread":0.24363740982739976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7109951950","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03028687,0.00017382384,0.9533611,0.0029268023,0.0012309364,0.0014741023,0.00005683343,0.00017128237,0.010318227],"genre_scores_gemma":[0.88119346,0.00022354447,0.109160416,0.0044996743,0.00019393033,0.0008100202,0.00032633217,0.000034839813,0.003557805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978042,0.000065079796,0.000946402,0.00026194955,0.00035751742,0.00056481856],"domain_scores_gemma":[0.9985446,0.00030286243,0.00023577255,0.0006057436,0.00021789156,0.00009316495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009151494,0.00025731558,0.00024604285,0.00041272247,0.0004967588,0.0006407628,0.0011896518,0.00013568024,0.000003623641],"category_scores_gemma":[0.000095157804,0.00019813277,0.00017299602,0.0011371671,0.00008059118,0.0011474488,0.0004199174,0.00033744914,0.00003866513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015622807,0.00046334782,0.0065119616,0.0005189173,0.00017597803,0.0000063021052,0.0052202702,0.007885953,0.00011968593,0.7831103,0.010181801,0.18564922],"study_design_scores_gemma":[0.0042911773,0.0002707391,0.0102170715,0.00033781875,0.000028535269,0.000040414372,0.0006722788,0.3876466,0.001512453,0.20169869,0.39249212,0.00079214555],"about_ca_topic_score_codex":0.0000164761,"about_ca_topic_score_gemma":0.000072418006,"teacher_disagreement_score":0.85090655,"about_ca_system_score_codex":0.000114671886,"about_ca_system_score_gemma":0.00018589624,"threshold_uncertainty_score":0.807962},"labels":[],"label_agreement":null},{"id":"W7109952297","doi":"10.4230/lipics.sat.2025.32","title":"Efficient Certified Reasoning for Binarized Neural Networks","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Alliance de recherche numérique du Canada; Vetenskapsrådet; National Supercomputing Centre Singapore; University of Toronto; Innovation, Science and Economic Development Canada","keywords":"Speedup; Soundness; Scalability; Robustness (evolution); Benchmark (surveying); Artificial neural network; Formal verification; Pipeline (software)","score_opus":0.011078407872012327,"score_gpt":0.2723201104293548,"score_spread":0.26124170255734247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7109952297","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022080366,0.00006671309,0.96880996,0.00090262154,0.0036481177,0.0017908654,0.00004293884,0.00051795936,0.0021404554],"genre_scores_gemma":[0.83566636,0.000004981406,0.1612586,0.0016193872,0.00025894822,0.0003509451,0.0001836644,0.00005171905,0.0006054282],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965488,0.00008268856,0.0012615009,0.00050958374,0.00043031952,0.0011671238],"domain_scores_gemma":[0.99711335,0.0006497031,0.00055220455,0.0011112657,0.00038386212,0.0001896022],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011414202,0.0005099279,0.00062951114,0.0004269354,0.0009284656,0.00072358723,0.0019945991,0.00031012096,0.00000900178],"category_scores_gemma":[0.0006214112,0.00047721123,0.00041857894,0.00081437343,0.00012296267,0.00073655986,0.0009864218,0.00067554286,0.000015594678],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004282192,0.00024484133,0.0021948148,0.0005141114,0.00023995756,0.0000052919577,0.003714351,0.83611995,0.000032717067,0.11843713,0.004034066,0.034034576],"study_design_scores_gemma":[0.0038793632,0.00013829883,0.00032292356,0.00017226419,0.000051122966,0.0000131004945,0.00029570726,0.9802649,0.00008235986,0.0006670188,0.013642369,0.00047056854],"about_ca_topic_score_codex":0.000016668486,"about_ca_topic_score_gemma":0.000005168952,"teacher_disagreement_score":0.813586,"about_ca_system_score_codex":0.00022210712,"about_ca_system_score_gemma":0.00012153673,"threshold_uncertainty_score":0.99976796},"labels":[],"label_agreement":null},{"id":"W7109957065","doi":"10.4230/lipics.itcs.2025.43","title":"Space Complexity of Minimum Cut Problems in Single-Pass Streams","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Simons Institute for the Theory of Computing, University of California Berkeley; National Science Foundation","keywords":"Upper and lower bounds; Minimum cut; Graph; Streaming algorithm; Time complexity; Space (punctuation); Data stream mining; Cut; Matching (statistics)","score_opus":0.03389015576445151,"score_gpt":0.26518836974327176,"score_spread":0.23129821397882025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7109957065","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28771478,0.0001517836,0.6802511,0.0020734172,0.0020883672,0.0024731648,0.00051428284,0.000382079,0.024351018],"genre_scores_gemma":[0.9033978,0.000025463443,0.095324144,0.000566758,0.000050455532,0.00009925381,0.00013592225,0.000022924856,0.00037728527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99680346,0.00006354704,0.00145111,0.0003828072,0.0005005044,0.00079855265],"domain_scores_gemma":[0.9977181,0.00024389185,0.0004932758,0.0011290078,0.00027754213,0.00013820991],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006387467,0.00041172502,0.00068033073,0.0006849274,0.0002099005,0.0002910679,0.0019778616,0.00020818932,0.000015412365],"category_scores_gemma":[0.00010013477,0.000401351,0.00029533965,0.0012668688,0.00043454135,0.0012896366,0.0009292848,0.00044367652,0.000019877838],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001540685,0.0035345808,0.025166651,0.0039112368,0.0003833764,0.0000121667945,0.023308685,0.0012125275,0.0007134675,0.8526258,0.0059079914,0.08306946],"study_design_scores_gemma":[0.010399328,0.0011111725,0.010916882,0.0022250065,0.000072266834,0.000053650914,0.0030129105,0.7183742,0.011377374,0.1688376,0.071827725,0.001791861],"about_ca_topic_score_codex":0.00010071731,"about_ca_topic_score_gemma":0.00028088127,"teacher_disagreement_score":0.7171617,"about_ca_system_score_codex":0.00015767249,"about_ca_system_score_gemma":0.00014409437,"threshold_uncertainty_score":0.99984384},"labels":[],"label_agreement":null},{"id":"W7109957739","doi":"10.4230/oasics.saia.2024.12","title":"A View on Vulnerabilites: The Security Challenges of XAI (Academic Track)","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Adversarial system; Transparency (behavior); Perspective (graphical); Evasion (ethics); Government (linguistics)","score_opus":0.017866769969852286,"score_gpt":0.2996563220959894,"score_spread":0.2817895521261371,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7109957739","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.113928184,0.0030497087,0.8041854,0.019500015,0.004621762,0.004651763,0.00022275117,0.0009073015,0.048933126],"genre_scores_gemma":[0.9892664,0.00044275285,0.007793334,0.002005959,0.00013109297,0.00014979245,0.000025891586,0.000027595359,0.00015717439],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996867,0.00019852602,0.0013103941,0.00038560288,0.00059450354,0.0006440002],"domain_scores_gemma":[0.99646693,0.0011376888,0.0005918372,0.0014271856,0.00027156278,0.000104818],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019298744,0.00041540203,0.0005923205,0.00030009742,0.00041785277,0.00014837236,0.0027919859,0.00029688797,0.000015401225],"category_scores_gemma":[0.0007258942,0.00030040805,0.00031572842,0.0006041826,0.00024195744,0.0011254273,0.00078469375,0.0013452446,0.000040562638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012374166,0.000337046,0.0012649889,0.0019616585,0.00024172403,0.0000023652176,0.035924353,0.004124728,0.000024211062,0.8390863,0.0020688297,0.11484006],"study_design_scores_gemma":[0.006488412,0.0009628319,0.0029770466,0.002591019,0.0001703153,0.000046193083,0.0073929774,0.6443391,0.0023757399,0.0883393,0.24283941,0.0014776911],"about_ca_topic_score_codex":0.000010736658,"about_ca_topic_score_gemma":0.000008777848,"teacher_disagreement_score":0.8753382,"about_ca_system_score_codex":0.00012944161,"about_ca_system_score_gemma":0.00014104051,"threshold_uncertainty_score":0.9999448},"labels":[],"label_agreement":null},{"id":"W7109962221","doi":"10.4230/lipics.icalp.2025.125","title":"Unbalanced Random Matching Markets with Partial Preferences","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Matching (statistics); Upper and lower bounds; Rank (graph theory); Stability (learning theory); Work (physics); Line (geometry)","score_opus":0.01564197783520071,"score_gpt":0.22603273638888216,"score_spread":0.21039075855368145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7109962221","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8207225,0.00021241828,0.08594117,0.00026200435,0.0014778634,0.0013199911,0.000698326,0.00018973784,0.089176],"genre_scores_gemma":[0.995038,0.000028582548,0.00173387,0.00045003195,0.00011160199,0.00017286562,0.00015041002,0.00002918551,0.0022854842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99757767,0.0000356242,0.0013854222,0.00030318293,0.000087594344,0.0006104822],"domain_scores_gemma":[0.9984003,0.00021676059,0.00068837637,0.00050904875,0.00008047338,0.000105071886],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013691006,0.00033378054,0.0007486584,0.00029793987,0.00032493417,0.0003369245,0.00052839634,0.00018720243,0.00011408904],"category_scores_gemma":[0.000119323005,0.00029732464,0.0001901393,0.0002905637,0.000110745204,0.00071822526,0.00011383236,0.00030694506,0.00024395119],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003634261,0.00056299806,0.22533187,0.00297736,0.0013227871,0.000006187308,0.016179267,0.00088554557,0.000027166543,0.738303,0.0051057446,0.0056638005],"study_design_scores_gemma":[0.05413235,0.0011131851,0.031597283,0.0032266953,0.00023548193,0.00008970057,0.009897919,0.052925687,0.0020082311,0.20226952,0.6386841,0.0038198463],"about_ca_topic_score_codex":0.000041054638,"about_ca_topic_score_gemma":0.00001975209,"teacher_disagreement_score":0.63357836,"about_ca_system_score_codex":0.00008510517,"about_ca_system_score_gemma":0.000042589476,"threshold_uncertainty_score":0.9999479},"labels":[],"label_agreement":null},{"id":"W7109965980","doi":"10.4230/lipics.socg.2025.27","title":"Computing Oriented Spanners and Their Dilation","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Deutscher Akademischer Austauschdienst","keywords":"Dilation (metric space); Metric space; Graph; Bounded function; Euclidean space; Spanner; Euclidean geometry","score_opus":0.0074592806182025954,"score_gpt":0.24557980452111358,"score_spread":0.238120523902911,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7109965980","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1370184,0.000065357526,0.85854286,0.00060899684,0.000885319,0.00046563437,0.000036103018,0.00015871602,0.0022186427],"genre_scores_gemma":[0.951282,0.000014273051,0.046764854,0.001254517,0.000091486974,0.000021455115,0.0002645243,0.0000095005435,0.0002973632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855864,0.00003175911,0.00061852275,0.00024460568,0.0001996539,0.0003467997],"domain_scores_gemma":[0.9988687,0.00020642762,0.0002142271,0.00034216163,0.0002753193,0.000093164075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045230903,0.0002302814,0.00023576968,0.00036015303,0.00042743926,0.00036215622,0.00040115564,0.000107275904,0.0000032171647],"category_scores_gemma":[0.00008761143,0.00020217462,0.000093969604,0.00064320996,0.00005417906,0.0011178401,0.0003467328,0.00017622593,0.000013006459],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010955887,0.00035318919,0.008794191,0.00073866354,0.0003288251,0.00000224836,0.019948868,0.013885782,0.0005438416,0.53716516,0.008536484,0.40959316],"study_design_scores_gemma":[0.0014612823,0.000088304216,0.0036298484,0.00010250949,0.000012039434,0.000015716705,0.00055979105,0.92897093,0.0016155033,0.0035349322,0.059730373,0.00027875285],"about_ca_topic_score_codex":0.000005124906,"about_ca_topic_score_gemma":0.000005024456,"teacher_disagreement_score":0.91508514,"about_ca_system_score_codex":0.00007018711,"about_ca_system_score_gemma":0.000084370404,"threshold_uncertainty_score":0.8244442},"labels":[],"label_agreement":null},{"id":"W7109966539","doi":"10.4230/lipics.socg.2025.53","title":"A PTAS for TSP with Neighbourhoods over Parallel Line Segments","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Travelling salesman problem; Neighbourhood (mathematics); Line segment; Approximation algorithm; Euclidean geometry; Line (geometry); Euclidean distance; Point (geometry)","score_opus":0.011387866767055601,"score_gpt":0.2773204266513546,"score_spread":0.265932559884299,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7109966539","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034217175,0.00007094005,0.95509297,0.00016323663,0.0007833629,0.001845162,0.00051906897,0.0005842123,0.0067238584],"genre_scores_gemma":[0.29995537,0.00007164486,0.6943219,0.0015254704,0.00023057208,0.00075852446,0.0010243785,0.00019823379,0.0019139476],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976239,0.000026489888,0.0010208056,0.00023594876,0.00030522235,0.0007876051],"domain_scores_gemma":[0.9985767,0.000217748,0.00020108865,0.00059122615,0.00024891636,0.00016430583],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005335272,0.00047504652,0.0005363643,0.0003245349,0.00025307114,0.00024570778,0.00046797693,0.00026507012,0.000051309562],"category_scores_gemma":[0.000119515586,0.00042916503,0.0002092881,0.00045760875,0.00007128957,0.00067533186,0.0001175567,0.0003416591,0.000023040478],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011733889,0.0006497598,0.022083586,0.006795799,0.002572442,0.000006409667,0.007424186,0.86365765,0.0003337212,0.015379218,0.033738002,0.046185806],"study_design_scores_gemma":[0.0073863543,0.00023944909,0.0010031202,0.00034509908,0.00014968711,0.000010899465,0.00040028818,0.93437773,0.001270302,0.00042740675,0.05374993,0.0006397567],"about_ca_topic_score_codex":0.0000054525935,"about_ca_topic_score_gemma":0.000009500254,"teacher_disagreement_score":0.2657382,"about_ca_system_score_codex":0.00019911848,"about_ca_system_score_gemma":0.000075368414,"threshold_uncertainty_score":0.999816},"labels":[],"label_agreement":null},{"id":"W7109970811","doi":"10.4230/lipics.itcs.2025.32","title":"Succinct Fermion Data Structures","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"U.S. Department of Energy","keywords":"Quantum computer; Qubit; Fermion; Overhead (engineering); Space (punctuation); Homogeneous space; Quantum; Time complexity","score_opus":0.018284661414837894,"score_gpt":0.2880888042983047,"score_spread":0.26980414288346677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7109970811","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08716107,0.00016536689,0.9012843,0.0018794617,0.003000749,0.00094095536,0.0004545657,0.00062568445,0.004487844],"genre_scores_gemma":[0.8202977,0.000030642022,0.17415151,0.0035468538,0.00033969842,0.000034586352,0.00088648783,0.000039439117,0.0006730771],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972927,0.000050566778,0.00091922976,0.00052389386,0.00044142499,0.00077219686],"domain_scores_gemma":[0.99665976,0.0002158949,0.00030017976,0.0024810398,0.00018404528,0.00015908518],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00063352654,0.00041812917,0.0004465661,0.00037273858,0.0005659949,0.00077114755,0.0042652613,0.00020194078,0.000011137382],"category_scores_gemma":[0.00014143657,0.00034530956,0.00016749754,0.00061519496,0.00009350315,0.0013296716,0.0025956016,0.00053220155,0.000040870855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014858323,0.0005238885,0.006845568,0.0017126505,0.00065966294,0.00003135244,0.007932285,0.005546732,0.00012459642,0.31218725,0.091699235,0.5725882],"study_design_scores_gemma":[0.001686408,0.000115898416,0.0031892108,0.00016548738,0.000029460802,0.000057247627,0.00013813375,0.8506229,0.00042389904,0.013855143,0.1292202,0.00049602333],"about_ca_topic_score_codex":0.00003109155,"about_ca_topic_score_gemma":0.000018111157,"teacher_disagreement_score":0.84507614,"about_ca_system_score_codex":0.00006954706,"about_ca_system_score_gemma":0.00017034858,"threshold_uncertainty_score":0.99989986},"labels":[],"label_agreement":null},{"id":"W7109976180","doi":"10.4230/lipics.icalp.2025.135","title":"Deterministic Independent Sets in the Semi-Streaming Model","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Independent set; Randomized algorithm; Set (abstract data type); Deterministic algorithm; Graph; Simple (philosophy)","score_opus":0.021156863291202654,"score_gpt":0.2862342634690988,"score_spread":0.26507740017789616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7109976180","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085384786,0.000060622027,0.89820075,0.0008913093,0.0009266456,0.0011862353,0.00017589326,0.00019250668,0.01298127],"genre_scores_gemma":[0.9712684,0.00002024354,0.025401004,0.0027963596,0.00003679545,0.00016705552,0.00006881816,0.000013987836,0.00022733292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99740016,0.000060097198,0.000970381,0.00032209585,0.0005282565,0.00071900774],"domain_scores_gemma":[0.99810356,0.00033942412,0.00023106256,0.0011126887,0.00012438497,0.00008890724],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00087786204,0.00034660194,0.00036099,0.00045510946,0.000428504,0.0006655671,0.0026366017,0.00017436409,0.000004589919],"category_scores_gemma":[0.0000980273,0.0002743236,0.0002199322,0.0007468993,0.00012175958,0.0010895767,0.0007468393,0.00057575904,0.00002689428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015102304,0.0018475945,0.01168062,0.0016109584,0.0003462672,0.00009660083,0.07569559,0.021735834,0.00006746937,0.6455874,0.009752091,0.23142858],"study_design_scores_gemma":[0.0013461037,0.00007187942,0.0013486184,0.00018546658,0.000018009565,0.00004367254,0.0009304478,0.96135306,0.000093033974,0.028362012,0.0059252298,0.00032244413],"about_ca_topic_score_codex":0.00001962188,"about_ca_topic_score_gemma":0.00007074515,"teacher_disagreement_score":0.9396173,"about_ca_system_score_codex":0.00011718035,"about_ca_system_score_gemma":0.00015870317,"threshold_uncertainty_score":0.9999709},"labels":[],"label_agreement":null},{"id":"W7109980574","doi":"10.4230/lipics.itcs.2025.67","title":"Error-Correcting Graph Codes","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Line graph; Null graph; Voltage graph; Butterfly graph; Hamming graph; Hamming code; Block graph; Linear code; Graph property; Block code","score_opus":0.019195820346420592,"score_gpt":0.31439216607789056,"score_spread":0.29519634573146997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7109980574","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053471357,0.000115096555,0.92362994,0.00047648815,0.0014823362,0.0011676226,0.00012678353,0.00058104686,0.018949319],"genre_scores_gemma":[0.90263295,0.000047382917,0.09185106,0.0023098043,0.00011073325,0.00032574675,0.00015929379,0.00005481806,0.0025082175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99669665,0.000090879636,0.0010395931,0.00043731093,0.00058437977,0.0011512139],"domain_scores_gemma":[0.9971117,0.0005841814,0.00031553864,0.0013576131,0.00041221877,0.00021876999],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012565732,0.00042230336,0.00049508415,0.0008350761,0.00073854957,0.0005989497,0.0025157854,0.00022857581,0.000019477104],"category_scores_gemma":[0.0003690138,0.0003921569,0.00030119022,0.0014313926,0.0002341535,0.0022983407,0.0010294965,0.0007405289,0.00013068604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030427586,0.0006302322,0.016821533,0.001388345,0.0005743517,0.000022198788,0.011375883,0.001351437,0.00039298585,0.7628673,0.015487731,0.18878375],"study_design_scores_gemma":[0.011620204,0.0009874223,0.0030819734,0.001320866,0.00011987811,0.00026980965,0.009030585,0.36967182,0.023628864,0.30416727,0.27287358,0.0032277373],"about_ca_topic_score_codex":0.000013642996,"about_ca_topic_score_gemma":0.00001869675,"teacher_disagreement_score":0.84916157,"about_ca_system_score_codex":0.00014479172,"about_ca_system_score_gemma":0.00015080022,"threshold_uncertainty_score":0.999853},"labels":[],"label_agreement":null},{"id":"W7109983441","doi":"10.4230/lipics.concur.2025.36","title":"Explainability is a Game for Probabilistic Bisimilarity Distances","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Probabilistic logic; State (computer science); Markov chain; Markov process; Markov decision process; Exponential function; Upper and lower bounds; Sequential game","score_opus":0.02050632036176338,"score_gpt":0.2980518053021301,"score_spread":0.27754548494036674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7109983441","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021839,0.000084825166,0.97006524,0.0021414093,0.00088037224,0.001825535,0.0005090286,0.00032961488,0.0023249725],"genre_scores_gemma":[0.91426975,0.000024185141,0.08087686,0.0031754232,0.00007716914,0.00079731946,0.00012310052,0.000022998525,0.00063322746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970022,0.000044248543,0.0011752859,0.0005400935,0.00038089906,0.0008573011],"domain_scores_gemma":[0.9972038,0.0003749343,0.00031539245,0.0012560673,0.000658484,0.00019131952],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00095420814,0.00042876363,0.00054530014,0.00021235817,0.00045140818,0.00070163625,0.0017435997,0.00025261517,0.000010285295],"category_scores_gemma":[0.00039864844,0.00038214462,0.0003404787,0.00052775885,0.00020022973,0.0014455618,0.0004401907,0.00035246907,0.000021050279],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043388119,0.0013621711,0.0057681277,0.0065998775,0.00037196217,0.0000035931048,0.02090561,0.000576533,0.000051341278,0.8172365,0.033513278,0.113177136],"study_design_scores_gemma":[0.002520209,0.00034689557,0.00060052675,0.0003535186,0.00006251375,0.000009270295,0.0005450421,0.6675074,0.00088242156,0.19543129,0.13095854,0.0007823632],"about_ca_topic_score_codex":0.000017438215,"about_ca_topic_score_gemma":0.000026283138,"teacher_disagreement_score":0.8924307,"about_ca_system_score_codex":0.00021089498,"about_ca_system_score_gemma":0.00030251296,"threshold_uncertainty_score":0.999863},"labels":[],"label_agreement":null},{"id":"W7109987506","doi":"10.4230/lipics.icdt.2025.30","title":"An FPRAS for Model Counting for Non-Deterministic Read-Once Branching Programs","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Leibniz-Gemeinschaft; University of Toronto; Austrian Science Fund","keywords":"Binary decision diagram; Branching (polymer chemistry); Bounding overwatch; Focus (optics); Binary number; Boolean function; Branching process; Propositional formula","score_opus":0.02417305238824984,"score_gpt":0.3103360934267998,"score_spread":0.28616304103854995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7109987506","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018620074,0.000022168375,0.97422504,0.0002627079,0.0012489597,0.0033079756,0.00036827478,0.0003780378,0.0015667473],"genre_scores_gemma":[0.39729857,0.000008271154,0.5989412,0.0015091035,0.00020485852,0.0012023723,0.00044725806,0.000050038157,0.00033833543],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965657,0.000023616498,0.0013055342,0.0005655522,0.00039962295,0.001139987],"domain_scores_gemma":[0.99711204,0.00045511225,0.00049894286,0.0011884748,0.00054731895,0.0001981207],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011641859,0.0005015021,0.0006139321,0.00036115863,0.0011499171,0.0013506528,0.0022795328,0.00023417661,0.0000018644398],"category_scores_gemma":[0.00018364788,0.0004978783,0.0004305507,0.00049135345,0.0001592757,0.0026311185,0.00042150982,0.0003433029,0.000006040733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043569296,0.0014366452,0.0021146312,0.0063315867,0.00044535802,0.000004132678,0.021425446,0.006056408,0.00030349454,0.39061227,0.0036098156,0.5672245],"study_design_scores_gemma":[0.0025627946,0.00043062904,0.000062111016,0.00040030538,0.000051312658,0.000011988179,0.0003866261,0.94384044,0.00031885708,0.03330102,0.01808305,0.00055086165],"about_ca_topic_score_codex":0.000011416255,"about_ca_topic_score_gemma":0.000027225537,"teacher_disagreement_score":0.937784,"about_ca_system_score_codex":0.00012287378,"about_ca_system_score_gemma":0.00024630793,"threshold_uncertainty_score":0.9997473},"labels":[],"label_agreement":null},{"id":"W7109999228","doi":"10.4230/lipics.disc.2025.55","title":"Brief Announcement: Concurrent Double-Ended Priority Queues","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Priority inheritance; Priority queue; Priority ceiling protocol; Queue; Priority inversion; Multilevel queue","score_opus":0.01507876169370958,"score_gpt":0.28471995167040764,"score_spread":0.26964118997669806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7109999228","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0376623,0.0005146817,0.8931156,0.0014943246,0.005870158,0.0029060848,0.0012886618,0.00079190533,0.05635633],"genre_scores_gemma":[0.98809433,0.00006857796,0.0064059575,0.0021232183,0.00018987256,0.00034575674,0.0008131147,0.000026213062,0.0019329486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9964994,0.00003838047,0.0014458784,0.00046679145,0.0006284997,0.00092101324],"domain_scores_gemma":[0.99743414,0.0000889267,0.00048348727,0.0012141415,0.0005591249,0.00022020961],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00073961227,0.0004754774,0.0006235159,0.0002446973,0.0005005733,0.0010652823,0.0019027598,0.000238425,0.000015617736],"category_scores_gemma":[0.00005077113,0.00043219642,0.00029571462,0.0007100162,0.00013335852,0.0020604052,0.00066818396,0.00043151327,0.00010946279],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018258761,0.00092836516,0.0091344025,0.0018814611,0.00047884329,0.000012596304,0.007570327,0.00016177466,0.00008899267,0.8251014,0.09970014,0.054759145],"study_design_scores_gemma":[0.0073874434,0.00017301792,0.0013202786,0.00040605047,0.000035516496,0.000022016575,0.0005230727,0.06919592,0.00078100344,0.001302013,0.91817445,0.00067923055],"about_ca_topic_score_codex":0.000049077087,"about_ca_topic_score_gemma":0.000034012013,"teacher_disagreement_score":0.95043206,"about_ca_system_score_codex":0.00027399443,"about_ca_system_score_gemma":0.00025941856,"threshold_uncertainty_score":0.9999717},"labels":[],"label_agreement":null},{"id":"W7110000962","doi":"10.4230/lipics.ccc.2025.21","title":"Reconstruction of Depth 3 Arithmetic Circuits with Top Fan-In 3","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Electronic circuit; Polynomial; Context (archaeology); Bounded function; Arithmetic circuit complexity; Constant (computer programming); Time complexity; Boolean circuit","score_opus":0.01237422835916938,"score_gpt":0.24770829661888488,"score_spread":0.2353340682597155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110000962","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18149424,0.000056917288,0.8012305,0.00030598257,0.0010579886,0.00089190324,0.00007293218,0.00014790925,0.014741643],"genre_scores_gemma":[0.91497064,0.000028992947,0.08428308,0.00038039873,0.00003495694,0.00007760493,0.000035576708,0.000013837503,0.00017491418],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997903,0.00003584254,0.00094293413,0.00027978502,0.00033794108,0.00050053326],"domain_scores_gemma":[0.9984441,0.00015689596,0.000320896,0.0007434912,0.00024918426,0.00008545248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004462716,0.0002694773,0.00044191806,0.00068308215,0.00016262269,0.00019018017,0.0010373172,0.00014276626,0.000009294902],"category_scores_gemma":[0.00006083693,0.00024029303,0.00015186986,0.0011345797,0.00018815685,0.001195284,0.00026831403,0.00033349707,0.000010035434],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009134561,0.000568303,0.073663406,0.0013716415,0.0002513128,0.000010292217,0.006510237,0.0003765177,0.00010391957,0.19911438,0.00054378266,0.7173949],"study_design_scores_gemma":[0.025775077,0.0023201131,0.09044139,0.0053339954,0.00021496764,0.00083657546,0.006530756,0.70033467,0.035253905,0.08952745,0.0400594,0.0033717055],"about_ca_topic_score_codex":0.000037465437,"about_ca_topic_score_gemma":0.000101565536,"teacher_disagreement_score":0.7334764,"about_ca_system_score_codex":0.00009515729,"about_ca_system_score_gemma":0.00015196796,"threshold_uncertainty_score":0.97988653},"labels":[],"label_agreement":null},{"id":"W7110004160","doi":"10.4230/lipics.mfcs.2025.27","title":"Cops and Robbers for Graphs on Surfaces with Crossings","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bounded function; Vertex (graph theory); Graph; 1-planar graph; Combinatorial game theory; Class (philosophy); Finite set; Pathwidth","score_opus":0.008104777419133605,"score_gpt":0.2520444242275468,"score_spread":0.2439396468084132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110004160","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2813464,0.000058090653,0.7134987,0.001073124,0.0005814528,0.0010068633,0.00009396912,0.00013254612,0.0022088333],"genre_scores_gemma":[0.8828149,0.000019293455,0.11283545,0.0026269157,0.000045539742,0.00015522545,0.00021902632,0.000016916301,0.0012667291],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986142,0.0000158038,0.00046825703,0.0002684181,0.00026045844,0.00037288078],"domain_scores_gemma":[0.9988184,0.00027000936,0.00019345374,0.00032994905,0.00029072384,0.000097487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036674115,0.00024323992,0.0002506976,0.0003152434,0.00054392056,0.00073842786,0.0004244802,0.00009790473,0.0000022468316],"category_scores_gemma":[0.00005222336,0.00020107755,0.000091105016,0.0004782751,0.00010543367,0.0010544845,0.00012876351,0.00013721592,0.0000062199206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000986669,0.0006434023,0.008702062,0.0016095348,0.0005876529,0.0000040709224,0.013059686,0.024831666,0.0003059423,0.7891168,0.034815904,0.12533662],"study_design_scores_gemma":[0.009410827,0.0015941213,0.0060278433,0.00050398364,0.00008282676,0.00004382532,0.0007427181,0.721648,0.0059390054,0.026062114,0.22690953,0.0010352246],"about_ca_topic_score_codex":0.000006519346,"about_ca_topic_score_gemma":0.000016863838,"teacher_disagreement_score":0.76305467,"about_ca_system_score_codex":0.000050682153,"about_ca_system_score_gemma":0.00011977295,"threshold_uncertainty_score":0.8199704},"labels":[],"label_agreement":null},{"id":"W7110020821","doi":"10.4230/lipics.cpm.2025.19","title":"The Trie Measure, Revisited","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Trie; Cardinality (data modeling); Monotone polygon; Encoding (memory); Binary number; Integer (computer science); Sequence (biology); Binary logarithm; Focus (optics)","score_opus":0.00988895079960905,"score_gpt":0.2593516950114112,"score_spread":0.24946274421180215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110020821","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013313845,0.0005494065,0.97619593,0.0016281132,0.0017182236,0.0010850703,0.00019399359,0.00033087985,0.016967019],"genre_scores_gemma":[0.60116327,0.0019278493,0.3495975,0.02441834,0.0013906469,0.0013354382,0.0020862948,0.00020790235,0.017872749],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99751264,0.000058627105,0.00095401605,0.00028691988,0.0005274227,0.00066035445],"domain_scores_gemma":[0.99724776,0.00034765835,0.00031405283,0.0015677183,0.00038246313,0.00014034286],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001045372,0.00031014738,0.00033625204,0.00018713783,0.0010693874,0.0011031864,0.002511284,0.00016057696,0.000007816479],"category_scores_gemma":[0.00023719751,0.00020444927,0.0002185129,0.00066778564,0.000108003514,0.001637564,0.001020837,0.0003810802,0.00010507474],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016225752,0.00025773508,0.001169208,0.0003862287,0.00028571443,0.000005999424,0.0020561349,0.00004963343,0.000056979527,0.31855872,0.22868294,0.44832844],"study_design_scores_gemma":[0.0018409257,0.00008494594,0.00059399096,0.00025083066,0.00002414737,0.000013729275,0.0001962127,0.13489464,0.00052021706,0.005027633,0.8562262,0.00032653182],"about_ca_topic_score_codex":0.000009867402,"about_ca_topic_score_gemma":0.0000051023458,"teacher_disagreement_score":0.6275433,"about_ca_system_score_codex":0.000092788076,"about_ca_system_score_gemma":0.0001442258,"threshold_uncertainty_score":0.9999338},"labels":[],"label_agreement":null},{"id":"W7110023545","doi":"10.4230/lipics.itcs.2025.19","title":"Differential Privacy and Sublinear Time Are Incompatible Sometimes","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Defense Advanced Research Projects Agency; National Science Foundation","keywords":"Sublinear function; Differential privacy; Simple (philosophy); Graph; Differential (mechanical device)","score_opus":0.01297844764835011,"score_gpt":0.2597744655268951,"score_spread":0.246796017878545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110023545","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3750446,0.00018627917,0.6018436,0.013969743,0.0013349665,0.0016860936,0.0007023212,0.0019844275,0.0032479384],"genre_scores_gemma":[0.6159276,0.00014521905,0.38064072,0.0014541422,0.00012350976,0.00019190427,0.00051543396,0.00005750316,0.00094398396],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971993,0.000045267683,0.0009864711,0.00049516384,0.00045832456,0.0008154951],"domain_scores_gemma":[0.9934729,0.00028426506,0.00044384724,0.0054177274,0.00023410372,0.00014721033],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00040517634,0.0004552166,0.00060396816,0.0007094291,0.000435313,0.0009898928,0.015035156,0.00031582697,0.000041143547],"category_scores_gemma":[0.0034360115,0.00041239176,0.00015499647,0.0008038294,0.00024769022,0.0025296637,0.048358567,0.0005323772,0.00013293969],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020363861,0.0011153773,0.047647107,0.002418803,0.00084791984,0.000020214255,0.0028208354,0.000027710666,0.00067252206,0.033129457,0.83330184,0.077794604],"study_design_scores_gemma":[0.004681933,0.0002647018,0.0071661756,0.0005690147,0.000072606286,0.000040126914,0.00030145637,0.82161325,0.008393611,0.07210684,0.08368636,0.0011039575],"about_ca_topic_score_codex":0.0000136691515,"about_ca_topic_score_gemma":0.000004238343,"teacher_disagreement_score":0.82158554,"about_ca_system_score_codex":0.00012250277,"about_ca_system_score_gemma":0.00010375033,"threshold_uncertainty_score":0.9998328},"labels":[],"label_agreement":null},{"id":"W7110023578","doi":"10.4230/lipics.icdt.2025.25","title":"Optimal Oblivious Algorithms for Multi-Way Joins","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Joins; Cloud computing; Matching (statistics); Upload; Logarithm; Cryptography; Join (topology); Computational complexity theory; Computation","score_opus":0.030582534926643958,"score_gpt":0.3035335577761135,"score_spread":0.27295102284946954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110023578","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014536503,0.000108719876,0.9776391,0.0004031538,0.0018380694,0.0018181328,0.0017932872,0.00042112483,0.0014419011],"genre_scores_gemma":[0.088635035,0.00007390134,0.9068447,0.0024078554,0.00017597091,0.00056632335,0.0010006102,0.000040944506,0.00025466256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99688894,0.000033066746,0.0011569395,0.0004921961,0.0003966488,0.0010322353],"domain_scores_gemma":[0.99744165,0.0002445489,0.0003426744,0.0013213404,0.00040689568,0.00024291489],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007329973,0.00048590134,0.00054958224,0.00057830854,0.0006594249,0.00083240273,0.0021343105,0.00029223075,0.000012273081],"category_scores_gemma":[0.00015147697,0.00045367266,0.0005432369,0.00080980064,0.00015862551,0.0023345542,0.0008420758,0.00040063736,0.00005267714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000396568,0.0029834164,0.004261013,0.0026847804,0.0010460414,0.000016515154,0.02599262,0.0005607536,0.00017808986,0.72661805,0.085879795,0.14938238],"study_design_scores_gemma":[0.0075401515,0.00043262495,0.0015229089,0.00021229424,0.00008011321,0.000034513338,0.0009754676,0.6760442,0.0015102889,0.0045429105,0.30615696,0.0009475718],"about_ca_topic_score_codex":0.00002300167,"about_ca_topic_score_gemma":0.000030458199,"teacher_disagreement_score":0.7220751,"about_ca_system_score_codex":0.00009939408,"about_ca_system_score_gemma":0.00015196991,"threshold_uncertainty_score":0.9997915},"labels":[],"label_agreement":null},{"id":"W7110032274","doi":"10.4230/lipics.itc.2025.2","title":"Powerful Primitives in the Bounded Quantum Storage Model","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Learning with errors; Encryption; Construct (python library); Bounded function; Quantum; Key (lock); Transmission (telecommunications); Quantum computer; Quantum cryptography","score_opus":0.013171682550288534,"score_gpt":0.27099156165774485,"score_spread":0.2578198791074563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110032274","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13610138,0.00011285388,0.849028,0.0012001825,0.00063366286,0.0011047604,0.00038751686,0.00016766113,0.011264019],"genre_scores_gemma":[0.9699113,0.00005282474,0.025611417,0.0039939,0.000037350095,0.00010615101,0.00022326894,0.000014143597,0.000049682276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99751705,0.0000792429,0.00088629924,0.0003326733,0.00047460457,0.00071014446],"domain_scores_gemma":[0.9979229,0.00026583378,0.00023658299,0.0013314051,0.00015149986,0.00009176937],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011004156,0.00034614684,0.00036528683,0.00047365986,0.0003674874,0.00082690094,0.0025956843,0.00018228836,0.0000058228034],"category_scores_gemma":[0.00010732755,0.00026412818,0.00026057573,0.0009521247,0.00018051318,0.0023783275,0.0006046395,0.0005476159,0.00003296415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066355715,0.00045652673,0.0013807704,0.00024741347,0.000060640636,0.000005656934,0.022148011,0.00027982172,0.000019771396,0.9648063,0.0081619015,0.0023668248],"study_design_scores_gemma":[0.0029198942,0.00016584537,0.004096925,0.0001960167,0.000029011875,0.000021551867,0.003306324,0.82811385,0.00018481075,0.11049444,0.0498747,0.00059661525],"about_ca_topic_score_codex":0.000021867987,"about_ca_topic_score_gemma":0.000049515023,"teacher_disagreement_score":0.8543119,"about_ca_system_score_codex":0.000083686966,"about_ca_system_score_gemma":0.00017614946,"threshold_uncertainty_score":0.9999811},"labels":[],"label_agreement":null},{"id":"W7110035064","doi":"10.4230/lipics.csl.2025.48","title":"Quantum and Classical Markovian Graphical Causal Models and Their Identification","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ministry of Colleges and Universities; Institut Périmètre de physique théorique; Government of Canada; John Templeton Foundation","keywords":"Categorical variable; Probabilistic logic; Subcategory; Causal structure; Markov process; Causal model; Hidden variable theory; Formalism (music); Quantum","score_opus":0.01186097664327536,"score_gpt":0.2550134408095874,"score_spread":0.243152464166312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110035064","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43540156,0.000055126264,0.5593331,0.0012154168,0.00024314692,0.0008682363,0.00078577123,0.00006480053,0.0020328928],"genre_scores_gemma":[0.99837154,0.000029113411,0.0004798021,0.00023065931,0.00007556892,0.00020889021,0.00041960774,0.000020356674,0.00016443481],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985653,0.000021509037,0.00065973593,0.00025546024,0.00013188485,0.0003660774],"domain_scores_gemma":[0.9990594,0.000105094885,0.00018667865,0.0003780744,0.00012293819,0.00014781822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028867894,0.00026714057,0.00030243158,0.0001625918,0.0004028155,0.0002999768,0.00022670478,0.00012133175,0.000014378326],"category_scores_gemma":[0.000008332873,0.00022666839,0.000117639356,0.00020728927,0.00013386627,0.00048818754,0.00018012487,0.00028664028,0.000008311115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028242928,0.00015025334,0.0016852535,0.000104166014,0.00010691708,9.891179e-8,0.0007822002,0.0000080894915,0.00019778495,0.98593444,0.0014448978,0.0095576625],"study_design_scores_gemma":[0.0013659768,0.00005708707,0.0013836583,0.000079823454,0.00006169631,0.0000035366863,0.0018843922,0.4603186,0.0005277442,0.5144533,0.019529518,0.00033471262],"about_ca_topic_score_codex":0.000020888501,"about_ca_topic_score_gemma":0.0000065003715,"teacher_disagreement_score":0.56297004,"about_ca_system_score_codex":0.00002078421,"about_ca_system_score_gemma":0.000046453868,"threshold_uncertainty_score":0.9243269},"labels":[],"label_agreement":null},{"id":"W7110046025","doi":"10.4230/lipics.approx/random.2025.18","title":"A Randomized Rounding Approach for DAG Edge Deletion","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Rounding; Bipartite graph; Directed acyclic graph; Vertex (graph theory); Directed graph; Complete bipartite graph; Graph; Enhanced Data Rates for GSM Evolution; Set (abstract data type)","score_opus":0.02299139336251356,"score_gpt":0.2822831772117847,"score_spread":0.25929178384927115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110046025","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032335918,0.000108470405,0.9808109,0.00042992522,0.0015932634,0.0030746346,0.00013078238,0.00033977441,0.0102786925],"genre_scores_gemma":[0.22434963,0.000060808947,0.76908314,0.0022415365,0.00028730676,0.0018003022,0.0007251706,0.00004341646,0.0014086695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970123,0.00008795455,0.0012875664,0.00041586492,0.00039116925,0.0008051214],"domain_scores_gemma":[0.99751073,0.00067098497,0.00041541026,0.00090274966,0.00035860838,0.00014151543],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019877227,0.00041817184,0.00084883824,0.00056088716,0.00073776476,0.0008554254,0.001681943,0.00022411044,0.0000060567145],"category_scores_gemma":[0.00026063676,0.00037282787,0.00069353794,0.0007057704,0.00020719793,0.0016735623,0.00056102226,0.00034238148,0.000014797688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004469052,0.00054548064,0.00018358217,0.001562808,0.00052568485,0.0000011728182,0.005785301,0.0005879972,0.000027605185,0.9224052,0.00862468,0.055281438],"study_design_scores_gemma":[0.07463244,0.00009257346,0.000024687386,0.0001444956,0.00007515,0.000017433335,0.00041751986,0.8484279,0.00030598257,0.028134665,0.047256753,0.00047039642],"about_ca_topic_score_codex":0.000013314035,"about_ca_topic_score_gemma":0.000003869953,"teacher_disagreement_score":0.89427054,"about_ca_system_score_codex":0.00015053066,"about_ca_system_score_gemma":0.00012481601,"threshold_uncertainty_score":0.9998724},"labels":[],"label_agreement":null},{"id":"W7110046292","doi":"10.4230/lipics.itcs.2025.11","title":"Rank Lower Bounds on Non-Local Quantum Computation","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Institut Périmètre de physique théorique; Government of Canada; Ministry of Colleges and Universities; Agence Nationale de la Recherche; Innovation, Science and Economic Development Canada","keywords":"Upper and lower bounds; Quantum entanglement; Rank (graph theory); Communication complexity; Quantum information science; Bounding overwatch; Randomness; Quantum; Function (biology); Quantum information","score_opus":0.006805257372883821,"score_gpt":0.2554954907077905,"score_spread":0.24869023333490667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110046292","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10327878,0.000025571544,0.8875325,0.0012436236,0.0031206969,0.0007156905,0.000062755695,0.00036778444,0.0036526166],"genre_scores_gemma":[0.9639529,0.000007894769,0.031722438,0.0035886369,0.0001699839,0.000054332777,0.0001297742,0.000031670286,0.0003423418],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970407,0.000040229363,0.0010421501,0.0004591515,0.0005683307,0.00084942847],"domain_scores_gemma":[0.99805456,0.00031326496,0.00033079763,0.00084560993,0.0002696621,0.0001860789],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006057653,0.00048693834,0.00051437964,0.00050635706,0.00065872795,0.0007436445,0.0014168671,0.00024066518,0.000006212364],"category_scores_gemma":[0.00006166146,0.00042476444,0.00033182776,0.0007385897,0.0001652934,0.0007219182,0.00053816114,0.00063401496,0.0001413452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006190275,0.0021140943,0.0011365798,0.0016679094,0.00070900086,0.000059566813,0.015091834,0.1209261,0.00013213769,0.23475952,0.07253243,0.5502518],"study_design_scores_gemma":[0.0024397168,0.00047527655,0.0007929862,0.00031140854,0.000018733084,0.000024321795,0.00015744304,0.9606367,0.00034643957,0.0065522008,0.027786884,0.00045789487],"about_ca_topic_score_codex":0.000017284,"about_ca_topic_score_gemma":0.0000049801315,"teacher_disagreement_score":0.86067414,"about_ca_system_score_codex":0.00014774175,"about_ca_system_score_gemma":0.00017275133,"threshold_uncertainty_score":0.9998204},"labels":[],"label_agreement":null},{"id":"W7110048490","doi":"10.4230/lipics.cp.2025.17","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National University of Singapore","keywords":"Trap (plumbing); Fixed point; Set (abstract data type); Probabilistic logic; Scalability; Enumeration; State space; Dynamical systems theory","score_opus":0.009202968421726498,"score_gpt":0.23954454680366546,"score_spread":0.23034157838193897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110048490","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7308135,0.00053558673,0.23837289,0.00040209395,0.0010487067,0.0010121039,0.00004676926,0.00016515762,0.027603187],"genre_scores_gemma":[0.98373145,0.00006486817,0.015211616,0.00041663533,0.000049197697,0.000032537708,0.000029069412,0.0000136317185,0.00045101033],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978663,0.00003987808,0.00093201443,0.00027466213,0.00024366894,0.00064348086],"domain_scores_gemma":[0.9986472,0.00023934101,0.00035056463,0.00046975934,0.00018519754,0.00010793969],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008558594,0.0002873546,0.0005048404,0.00033857973,0.0001867368,0.00035434723,0.0008266857,0.00019695977,0.000008066389],"category_scores_gemma":[0.00013987265,0.00025658315,0.00012879947,0.00056206936,0.00014971553,0.0011971026,0.0004964019,0.00029819258,0.000009396153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042828778,0.0012469449,0.59216315,0.0037126946,0.0004538159,0.000022302436,0.046898097,0.0010730405,0.00016353565,0.24999458,0.015888304,0.08795526],"study_design_scores_gemma":[0.0059677204,0.00035487773,0.04338917,0.0009675421,0.000047789905,0.000030579526,0.0021892784,0.91861326,0.0013352296,0.0028898208,0.023466546,0.00074817194],"about_ca_topic_score_codex":0.000037121594,"about_ca_topic_score_gemma":0.0000958033,"teacher_disagreement_score":0.91754025,"about_ca_system_score_codex":0.00006494963,"about_ca_system_score_gemma":0.000093395225,"threshold_uncertainty_score":0.9999886},"labels":[],"label_agreement":null},{"id":"W7110076330","doi":"10.4230/lipics.aft.2025.30","title":"Ticket to Ride: Locally Steered Source Routing for the Lightning Network","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Traverse; Ticket; Relay; Train; Routing (electronic design automation); Overhead (engineering); Channel (broadcasting); Landmark; Latency (audio)","score_opus":0.0069853999229418165,"score_gpt":0.2272152971059407,"score_spread":0.2202298971829989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110076330","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025527231,0.00041159932,0.9603285,0.0006031069,0.0021489286,0.0035268557,0.00017556806,0.00078884594,0.0064893262],"genre_scores_gemma":[0.96198773,0.000054258384,0.027785122,0.0036394498,0.0013255737,0.0010398418,0.0004263351,0.00026023138,0.0034814314],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99645746,0.00003007483,0.0013169722,0.0002836621,0.00038111064,0.0015307155],"domain_scores_gemma":[0.9976959,0.00074830255,0.00018624184,0.000885014,0.00024584596,0.00023869723],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011407553,0.0005685462,0.00060640654,0.00018582903,0.0006945825,0.00050582166,0.0010170668,0.00030041297,0.000033858025],"category_scores_gemma":[0.00021763897,0.0004759916,0.00036956428,0.0006441704,0.00007028672,0.00047356205,0.00035147739,0.0006052439,0.00015858923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009364008,0.000028111554,0.00052362005,0.00048300167,0.0004642737,0.0000013725212,0.0019247666,0.91026944,0.00002415168,0.0018880084,0.06291592,0.021383666],"study_design_scores_gemma":[0.0011539039,0.00006034819,0.00012473497,0.0003555929,0.0001029294,0.000009309565,0.00049464975,0.6322448,0.00017698089,0.00012412525,0.36478803,0.00036457277],"about_ca_topic_score_codex":0.0000097576285,"about_ca_topic_score_gemma":0.000060903352,"teacher_disagreement_score":0.93646055,"about_ca_system_score_codex":0.00027262254,"about_ca_system_score_gemma":0.00007302342,"threshold_uncertainty_score":0.99976915},"labels":[],"label_agreement":null},{"id":"W7110111634","doi":"10.4230/lipics.socg.2025.52","title":"Uniform Bounds on Product Sylvester-Gallai Configurations","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Product (mathematics); Bounded function; Extension (predicate logic); Algebraically closed field; Degree (music); Homogeneous; Scalar (mathematics); Polynomial","score_opus":0.015473343887221776,"score_gpt":0.273397003867277,"score_spread":0.25792365998005523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110111634","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02935086,0.00009998961,0.83345807,0.0064444854,0.0049103075,0.0026847702,0.00046950273,0.0009744757,0.12160752],"genre_scores_gemma":[0.89214325,0.00007424702,0.09042078,0.009358617,0.0004044085,0.0004835416,0.00063917594,0.000059728874,0.006416228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971864,0.000039656396,0.0010595851,0.00043288505,0.000511506,0.0007699426],"domain_scores_gemma":[0.997437,0.00020939804,0.00030281066,0.0015014359,0.0003757364,0.0001735927],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005491124,0.0004340295,0.00043502948,0.0005903808,0.0008539065,0.0011143467,0.001914548,0.00015484456,0.000030208772],"category_scores_gemma":[0.00012458792,0.0003975771,0.00028845386,0.000932664,0.00020823826,0.0018258245,0.0004900902,0.00050099613,0.00015999918],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000613242,0.0005724871,0.00070513214,0.00047352776,0.00023056108,0.000005213821,0.0039996854,0.00024142156,0.00006385103,0.9232102,0.01997412,0.050462496],"study_design_scores_gemma":[0.004006408,0.00067387783,0.0030123885,0.0005780521,0.000063949505,0.00006739145,0.0007342063,0.15243758,0.0039888243,0.03969884,0.79352266,0.0012158288],"about_ca_topic_score_codex":0.00001580305,"about_ca_topic_score_gemma":0.000029901059,"teacher_disagreement_score":0.88351136,"about_ca_system_score_codex":0.0001566493,"about_ca_system_score_gemma":0.00023778153,"threshold_uncertainty_score":0.9999226},"labels":[],"label_agreement":null},{"id":"W7110121538","doi":"10.4230/lipics.wads.2025.8","title":"Tight Bounds on the Number of Closest Pairs in Vertical Slabs","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Science and ICT, South Korea; Fonds De La Recherche Scientifique - FNRS; Institute for Information and Communications Technology Promotion; National Science Foundation","keywords":"Hyperplane; Sequence (biology); Set (abstract data type); Point (geometry); Upper and lower bounds","score_opus":0.012313831353453888,"score_gpt":0.27683690768450436,"score_spread":0.2645230763310505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110121538","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6681765,0.00002972081,0.29986304,0.003472924,0.00130914,0.00084440754,0.00005626767,0.00009014655,0.026157886],"genre_scores_gemma":[0.9909994,0.000009277183,0.0064171785,0.0019813555,0.00004932808,0.00006405843,0.000060563245,0.0000077276245,0.00041112732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826634,0.000054187654,0.00076920993,0.00018623025,0.0003826333,0.00034140173],"domain_scores_gemma":[0.99863905,0.0004638731,0.00012002296,0.0005256725,0.00019162375,0.00005978862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006124166,0.00019242897,0.00024310633,0.00023637584,0.00018046229,0.00019305405,0.00079629006,0.000111964175,0.000029146513],"category_scores_gemma":[0.00017139346,0.00014338573,0.0001358621,0.000789772,0.00008780044,0.0005972474,0.00024412268,0.00025578393,0.00008095678],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000100833975,0.0003616668,0.012447831,0.0002278044,0.00009043174,0.0000026493708,0.002958773,0.0011609729,0.00009062249,0.95913863,0.010324113,0.01309566],"study_design_scores_gemma":[0.0057356465,0.00045879468,0.034044188,0.00065858045,0.000051135237,0.00003945734,0.0008504196,0.7213789,0.016906857,0.046612214,0.17235363,0.00091014436],"about_ca_topic_score_codex":0.0000092297805,"about_ca_topic_score_gemma":0.000013581459,"teacher_disagreement_score":0.9125264,"about_ca_system_score_codex":0.000088988614,"about_ca_system_score_gemma":0.00014569421,"threshold_uncertainty_score":0.58471},"labels":[],"label_agreement":null},{"id":"W7110127072","doi":"10.4230/lipics.esa.2025.44","title":"Near-Optimal Vertex Fault-Tolerant Labels for Steiner Connectivity","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Azrieli Foundation; European Commission","keywords":"Steiner tree problem; Vertex (graph theory); Upper and lower bounds; Graph; Connectivity; Vertex connectivity; Set (abstract data type); Spanning tree; Terminal (telecommunication)","score_opus":0.014488975413341154,"score_gpt":0.27196938662608927,"score_spread":0.2574804112127481,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110127072","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.097934775,0.00008252388,0.89254117,0.0011974167,0.0023508652,0.001816354,0.0005947183,0.00041040016,0.0030717913],"genre_scores_gemma":[0.6974902,0.000025445665,0.2950133,0.004566794,0.00018955927,0.00065031275,0.0003345061,0.000059094204,0.0016707783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99694353,0.00004943622,0.0010601765,0.0004874605,0.00044867364,0.0010107467],"domain_scores_gemma":[0.9972507,0.0005930583,0.000316886,0.0011674546,0.0004723363,0.00019960736],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007918389,0.00049081695,0.000653489,0.0003063524,0.00091770355,0.0009705815,0.0018730375,0.00025366675,0.00001933848],"category_scores_gemma":[0.0001954855,0.00045580568,0.0004678205,0.00068556424,0.00023175048,0.0018060219,0.0007758257,0.00043361873,0.000054426986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005545579,0.0017342425,0.0028778452,0.002350346,0.0010665203,0.000014091704,0.013823726,0.003733983,0.00018836591,0.71291006,0.04640848,0.2143378],"study_design_scores_gemma":[0.0044066524,0.00034654085,0.00060986506,0.00019281733,0.000046124973,0.00002100522,0.000310673,0.773192,0.001078207,0.009234424,0.20995836,0.00060333166],"about_ca_topic_score_codex":0.000028675384,"about_ca_topic_score_gemma":0.000028270242,"teacher_disagreement_score":0.769458,"about_ca_system_score_codex":0.00013544573,"about_ca_system_score_gemma":0.00022273388,"threshold_uncertainty_score":0.99978936},"labels":[],"label_agreement":null},{"id":"W7110163560","doi":"10.4230/lipics.wads.2025.27","title":"A QPTAS for Facility Location on Unit Disk Graphs","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Facility location problem; Vertex (graph theory); Unit disk graph; Approximation algorithm; Euclidean distance; Set (abstract data type); Unit disk; Enhanced Data Rates for GSM Evolution; Graph; 1-center problem","score_opus":0.027500906135042524,"score_gpt":0.26832047376776164,"score_spread":0.2408195676327191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110163560","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45815814,0.00011616206,0.40394494,0.009955648,0.0078187995,0.013022025,0.0018619616,0.0013741751,0.103748165],"genre_scores_gemma":[0.98480487,0.000019258741,0.0006615502,0.0077014007,0.00016468357,0.00075752917,0.0031380667,0.00002565373,0.0027269698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976986,0.000010531002,0.0010346514,0.00032674862,0.00035768622,0.0005717681],"domain_scores_gemma":[0.9983382,0.00006538474,0.00022414986,0.00069067837,0.0006475672,0.000033985983],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00076930865,0.00037939116,0.00035172197,0.00062754727,0.00056441803,0.00042577166,0.0005649204,0.00015161179,0.00012841387],"category_scores_gemma":[0.00032602515,0.0003568791,0.00027270953,0.0008646513,0.000093019655,0.0015183194,0.00021313838,0.00019725758,0.00055281876],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011840533,0.0016135524,0.023116894,0.012630787,0.0006494707,7.999565e-7,0.0014222949,0.00652296,0.000025112373,0.721859,0.15364319,0.07733194],"study_design_scores_gemma":[0.0030235427,0.00006319832,0.0067308806,0.00017716977,0.00014262758,2.5839563e-7,0.0018143493,0.091345,0.000072082184,0.0083631165,0.88774806,0.00051968865],"about_ca_topic_score_codex":0.00019209813,"about_ca_topic_score_gemma":0.00029470088,"teacher_disagreement_score":0.7341049,"about_ca_system_score_codex":0.00009452143,"about_ca_system_score_gemma":0.000043540917,"threshold_uncertainty_score":0.9998883},"labels":[],"label_agreement":null},{"id":"W7110165342","doi":"10.4230/lipics.cpm.2025.11","title":"On Palindromic Periodicities","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Palindrome; Prefix; Palindromic sequence; Word (group theory); Sequence (biology)","score_opus":0.006257707685843562,"score_gpt":0.24302485724839054,"score_spread":0.236767149562547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110165342","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43481895,0.00014788756,0.5121239,0.0016744689,0.0033922824,0.0012946676,0.00030890314,0.0009516899,0.04528724],"genre_scores_gemma":[0.9780565,0.000028282719,0.012413135,0.0073365234,0.00008545975,0.00013141679,0.00012185436,0.000026568223,0.0018002555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99780685,0.000037170386,0.00081978703,0.0003045557,0.0003639156,0.0006677285],"domain_scores_gemma":[0.99814624,0.00028667942,0.0002336419,0.0010808815,0.00012980457,0.00012273167],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005124252,0.0003651966,0.00041444894,0.000403493,0.00044453787,0.0006865135,0.0016900296,0.00018774715,0.000040150047],"category_scores_gemma":[0.000097474636,0.00031591815,0.00025633269,0.00038230568,0.00014065015,0.0011027959,0.00048561374,0.00033983015,0.0002688144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080912534,0.0002552715,0.00070129713,0.00041258446,0.00015824253,0.000007920125,0.006808063,0.00014644407,0.00007056018,0.93819296,0.022354495,0.030811267],"study_design_scores_gemma":[0.010825915,0.0011961642,0.0035197693,0.0016088602,0.000107406675,0.00012814258,0.005030828,0.45847443,0.008773914,0.17859697,0.32932562,0.0024119806],"about_ca_topic_score_codex":0.000010192543,"about_ca_topic_score_gemma":0.0000040628506,"teacher_disagreement_score":0.759596,"about_ca_system_score_codex":0.00012351437,"about_ca_system_score_gemma":0.00011754963,"threshold_uncertainty_score":0.9999293},"labels":[],"label_agreement":null},{"id":"W7110182728","doi":"10.4230/lipics.socg.2025.76","title":"A Note on the No-(d+2)-On-a-Sphere Problem","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Cube (algebra); Construct (python library); Upper and lower bounds; Fixed point; Dimension (graph theory)","score_opus":0.02982649432739289,"score_gpt":0.31478797367448874,"score_spread":0.28496147934709587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110182728","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03871751,0.000010221228,0.16196373,0.008635715,0.0010658217,0.0060497797,0.00040139566,0.0006081745,0.78254765],"genre_scores_gemma":[0.5020841,0.000068411224,0.3541434,0.049800992,0.0009637047,0.005127409,0.00092958723,0.00040811813,0.086474314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99713826,0.000072479226,0.0013519885,0.0002574327,0.0006090886,0.0005707338],"domain_scores_gemma":[0.99661976,0.0014296194,0.00045004458,0.0009510978,0.00043317588,0.00011627344],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009679155,0.0004721432,0.0005084407,0.00018495912,0.0004769791,0.0003448118,0.0007077716,0.0002752907,0.0005631225],"category_scores_gemma":[0.001459824,0.00028793482,0.00034173488,0.00037095582,0.00013303444,0.0003809065,0.00013361797,0.00064332393,0.0012980129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014088237,0.0004994956,0.000020116167,0.0009720121,0.00009411155,4.524721e-7,0.00235604,0.00000739816,0.000020503829,0.878728,0.11384999,0.0033110105],"study_design_scores_gemma":[0.0030349582,0.00060493336,0.000030208785,0.0016792667,0.00010476305,0.000008852956,0.0017076478,0.07389487,0.0034299372,0.5693131,0.34551063,0.000680831],"about_ca_topic_score_codex":0.0000033862643,"about_ca_topic_score_gemma":0.000011286444,"teacher_disagreement_score":0.69607335,"about_ca_system_score_codex":0.00017157856,"about_ca_system_score_gemma":0.000092925955,"threshold_uncertainty_score":0.99995726},"labels":[],"label_agreement":null},{"id":"W7110184166","doi":"10.4230/lipics.disc.2025.58","title":"Brief Announcement: Optimal-Length Labeling Schemes for Fast Deterministic Communication in Radio Networks","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Université du Québec en Outaouais","keywords":"Broadcasting (networking); Node (physics); Gossip; Constant (computer programming); Radio networks; Scheme (mathematics); Asymptotically optimal algorithm; Radio broadcasting","score_opus":0.01384619250655066,"score_gpt":0.27325991403683453,"score_spread":0.25941372153028386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110184166","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009614021,0.0003568971,0.98521036,0.00047664362,0.00080338115,0.001483964,0.00016799122,0.00019716879,0.0016895988],"genre_scores_gemma":[0.5160784,0.00029617222,0.47969687,0.0019362177,0.00012377907,0.00068574573,0.0007241328,0.00004119373,0.00041744666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99724835,0.00005522423,0.0012501639,0.00035448957,0.00029484485,0.0007969487],"domain_scores_gemma":[0.99748415,0.0004970464,0.00037008637,0.0012341298,0.00030223586,0.00011233945],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009866314,0.00037457162,0.0004914198,0.0004386854,0.00061991514,0.00067403726,0.0021282253,0.00020105795,0.000006140763],"category_scores_gemma":[0.0001482713,0.00039049858,0.00022783547,0.0007567957,0.00017138208,0.001411452,0.0007959097,0.00045987652,0.0000070027795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035095858,0.0013322599,0.005746057,0.0020410088,0.0005205366,0.00000785492,0.014812736,0.017887663,0.000033149558,0.5563284,0.008766351,0.39217302],"study_design_scores_gemma":[0.002860756,0.00014458073,0.00028035181,0.00044308027,0.000025435922,0.00000987251,0.00044770655,0.8955959,0.000098946366,0.0034644355,0.09623213,0.0003968129],"about_ca_topic_score_codex":0.000017699303,"about_ca_topic_score_gemma":0.000040695097,"teacher_disagreement_score":0.8777082,"about_ca_system_score_codex":0.00017195618,"about_ca_system_score_gemma":0.00012480523,"threshold_uncertainty_score":0.9998547},"labels":[],"label_agreement":null},{"id":"W7110189454","doi":"10.4230/lipics.socg.2025.19","title":"Polychromatic Coloring of Tuples in Hypergraphs","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa; University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Hypergraph; Tuple; Set (abstract data type); Constant (computer programming); Characterization (materials science)","score_opus":0.012267265345861035,"score_gpt":0.292994078523558,"score_spread":0.280726813177697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110189454","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67381996,0.0001946937,0.3139508,0.00032262172,0.00062071026,0.0014704737,0.00008331139,0.00018799635,0.009349417],"genre_scores_gemma":[0.9591294,0.000046825746,0.040065844,0.0002793764,0.000015832109,0.00015359538,0.00002499839,0.000018350967,0.00026578933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972553,0.0000639915,0.0011992853,0.00027343328,0.0004543504,0.0007535895],"domain_scores_gemma":[0.99794513,0.000447979,0.00029147367,0.0009857554,0.00021568182,0.000113997725],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008752289,0.0002875479,0.00052407256,0.0011319584,0.00016902522,0.00015236391,0.001871789,0.00014788726,0.000008400227],"category_scores_gemma":[0.00023545571,0.0002714473,0.00021218199,0.0015959954,0.00021561854,0.0015015908,0.00070521916,0.0003670254,0.000022753868],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002537993,0.00072278624,0.06384583,0.002579997,0.0002597771,0.000013148375,0.007713012,0.0009591959,0.001735468,0.8869588,0.0008459032,0.034112323],"study_design_scores_gemma":[0.02029549,0.0015325384,0.04484832,0.003913771,0.00009351114,0.0000971661,0.0077295015,0.50503004,0.0613544,0.3205699,0.031859815,0.002675578],"about_ca_topic_score_codex":0.000019575116,"about_ca_topic_score_gemma":0.000029011131,"teacher_disagreement_score":0.56638885,"about_ca_system_score_codex":0.00011966145,"about_ca_system_score_gemma":0.00014409784,"threshold_uncertainty_score":0.9999738},"labels":[],"label_agreement":null},{"id":"W7110192836","doi":"10.4230/lipics.mfcs.2025.85","title":"Cutoff Theorems for the Equivalence of Parameterized Quantum Circuits","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Parameterized complexity; Equivalence (formal languages); Modulo; Electronic circuit; Quantum gate; Quantum circuit; Quantum algorithm; Probabilistic logic; Quantum; Formal equivalence checking","score_opus":0.014438882305444956,"score_gpt":0.2711900122484945,"score_spread":0.25675112994304955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110192836","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06523588,0.0001603822,0.9289674,0.0010782566,0.0018494657,0.0015653208,0.00022797137,0.0001901917,0.0007251169],"genre_scores_gemma":[0.95004946,0.000046304933,0.047772273,0.0014325994,0.00012554701,0.00022332458,0.000050259914,0.00003009396,0.0002701641],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99726343,0.00005679444,0.0011493765,0.00034629463,0.00041612706,0.000767999],"domain_scores_gemma":[0.99627674,0.0014473948,0.0005405351,0.0012789858,0.0003549423,0.00010138139],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011380016,0.0003810281,0.0005431592,0.00024718323,0.0005410388,0.00037222638,0.002713909,0.00016341447,0.0000045681686],"category_scores_gemma":[0.0002942489,0.0002599319,0.00044846075,0.00060574757,0.0002636018,0.000523601,0.0006792591,0.00035794228,0.00000926702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021946557,0.00048471225,0.00069907843,0.002128369,0.00066567794,0.0000029092575,0.012357366,0.0051989094,0.00093073107,0.651708,0.005939529,0.31966525],"study_design_scores_gemma":[0.0020519772,0.00033548698,0.000372793,0.00030294262,0.000049505656,0.00001638118,0.0003155764,0.9469924,0.0019648024,0.024432156,0.022825133,0.00034086016],"about_ca_topic_score_codex":0.000012584024,"about_ca_topic_score_gemma":0.0000018510827,"teacher_disagreement_score":0.9417935,"about_ca_system_score_codex":0.000046645036,"about_ca_system_score_gemma":0.00016261509,"threshold_uncertainty_score":0.9999853},"labels":[],"label_agreement":null},{"id":"W7110198478","doi":"10.4230/lipics.itcs.2025.89","title":"Optimal Communication Complexity of Chained Index","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Waterloo","keywords":"String (physics); Generalization; Upper and lower bounds; Index (typography); Position (finance); Value (mathematics)","score_opus":0.02479467919637605,"score_gpt":0.27863430581502757,"score_spread":0.2538396266186515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110198478","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046799406,0.00009544664,0.9403441,0.0012403079,0.0006162857,0.0008589573,0.00020631745,0.00024196594,0.009597213],"genre_scores_gemma":[0.8009088,0.000035658388,0.19776839,0.0007575288,0.000028716015,0.00006953644,0.00018895851,0.0000128430265,0.00022955309],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976865,0.000065845736,0.0011253131,0.00023415555,0.00039395064,0.00049424294],"domain_scores_gemma":[0.9972456,0.0002193262,0.00046094836,0.0015522044,0.00041654537,0.00010536518],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006982451,0.00029157475,0.00048115835,0.0004378414,0.0004265205,0.00024071128,0.0025766112,0.0001691513,0.000019209221],"category_scores_gemma":[0.000088837456,0.0002870782,0.00027006777,0.000803442,0.0004826429,0.0011471132,0.0012483513,0.00039198503,0.000016181484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011128354,0.0006255417,0.0042452677,0.0007158106,0.0002558809,0.0000011355454,0.0066360165,0.00076740794,0.00004615298,0.95543516,0.004214096,0.02694627],"study_design_scores_gemma":[0.003736562,0.00022482789,0.0070514097,0.0003691817,0.000033647928,0.000017524211,0.0009278111,0.8986163,0.0018820897,0.048994187,0.037580814,0.0005656488],"about_ca_topic_score_codex":0.00005016858,"about_ca_topic_score_gemma":0.000028123222,"teacher_disagreement_score":0.906441,"about_ca_system_score_codex":0.00008260509,"about_ca_system_score_gemma":0.0001176391,"threshold_uncertainty_score":0.99995816},"labels":[],"label_agreement":null},{"id":"W7110209134","doi":"10.4230/lipics.approx/random.2025.1","title":"Approximation Schemes for Orienteering and Deadline TSP in Doubling Metrics","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Orienteering; Bounded function; Travelling salesman problem; Hamiltonian path; Treewidth; Dimension (graph theory); Path (computing); Graph","score_opus":0.01875167200096725,"score_gpt":0.2838451202113926,"score_spread":0.26509344821042535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110209134","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058303226,0.00016269642,0.9384294,0.00039594248,0.00072929624,0.0010564731,0.000069124726,0.00014668131,0.00070711825],"genre_scores_gemma":[0.43283522,0.00006802287,0.5656902,0.00068988977,0.00008379087,0.00029168613,0.00016872726,0.000021361668,0.00015110716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99800146,0.000016567863,0.00088498904,0.00029711865,0.00026605744,0.0005338283],"domain_scores_gemma":[0.9986522,0.00031508395,0.00022244449,0.00047296935,0.00024830925,0.0000889967],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008484504,0.00026445283,0.00036219484,0.000947629,0.00030515337,0.0005293696,0.00076949206,0.00014427991,0.0000018041748],"category_scores_gemma":[0.00026895915,0.0002609068,0.00013284934,0.0012615683,0.00007211565,0.0016151405,0.0005080148,0.00026434555,0.0000028052937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011255009,0.00037667569,0.008744206,0.0022172446,0.0001424325,0.0000020953357,0.0059307846,0.00040813832,0.00006493876,0.76065415,0.0007418277,0.22060497],"study_design_scores_gemma":[0.0032897193,0.00010614614,0.00047389936,0.00024217929,0.000017763432,0.0000090608155,0.0005115586,0.9139563,0.0013838602,0.016270973,0.06338823,0.00035030543],"about_ca_topic_score_codex":0.000011595186,"about_ca_topic_score_gemma":0.00001750644,"teacher_disagreement_score":0.9135482,"about_ca_system_score_codex":0.00010241449,"about_ca_system_score_gemma":0.00006702151,"threshold_uncertainty_score":0.9999843},"labels":[],"label_agreement":null},{"id":"W7110215014","doi":"10.4230/lipics.stacs.2025.64","title":"Cluster Editing on Cographs and Related Classes","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Parameterized complexity; Time complexity; Permutation (music); Upper and lower bounds; Connected component; Computational complexity theory; Cograph","score_opus":0.010841416548416588,"score_gpt":0.28794879680089236,"score_spread":0.2771073802524758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110215014","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23781872,0.00024799947,0.66805536,0.0038024867,0.0032193656,0.003405958,0.0003282094,0.001090096,0.08203179],"genre_scores_gemma":[0.96779096,0.0000830957,0.027130986,0.002960433,0.00008369007,0.00017519975,0.00009865429,0.000041265954,0.0016357359],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973938,0.000080154336,0.0008579284,0.00038700338,0.00046730548,0.00081381836],"domain_scores_gemma":[0.99776655,0.00064399885,0.00025686048,0.0008734294,0.00027251066,0.00018666069],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000886553,0.00034883092,0.0003767839,0.00076481095,0.0005378944,0.00052840915,0.001163897,0.00021772496,0.0000106099415],"category_scores_gemma":[0.00031566987,0.00030983536,0.00018189028,0.00096355507,0.00026734345,0.0016969489,0.00078675867,0.0006365386,0.00006089107],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029167836,0.00038849254,0.009583153,0.0009705119,0.00043811568,0.000017427987,0.0056606345,0.00035373276,0.000114932074,0.8800407,0.014280269,0.08786034],"study_design_scores_gemma":[0.016534127,0.0017211995,0.00611319,0.001941764,0.00011188018,0.00021635221,0.004218856,0.3806872,0.0053052204,0.3011969,0.27969146,0.002261842],"about_ca_topic_score_codex":0.0000027627736,"about_ca_topic_score_gemma":0.0000042499846,"teacher_disagreement_score":0.72997224,"about_ca_system_score_codex":0.000077384335,"about_ca_system_score_gemma":0.0000666941,"threshold_uncertainty_score":0.9999354},"labels":[],"label_agreement":null},{"id":"W7110230378","doi":"10.4230/lipics.aft.2025.20","title":"Selfish Mining Under General Stochastic Rewards","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"New York Institute of Technology","funders":"National Science Foundation","keywords":"Incentive; Function (biology); Profitability index; Block (permutation group theory); Set (abstract data type); Database transaction; Transaction cost","score_opus":0.009262618082973512,"score_gpt":0.2572371241605682,"score_spread":0.2479745060775947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110230378","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.105644576,0.00006845434,0.8860498,0.0023000552,0.00066716917,0.00074160076,0.000076112265,0.0005938,0.0038584264],"genre_scores_gemma":[0.879371,0.000014733231,0.11529747,0.0037780802,0.00008540604,0.0003612273,0.00010471378,0.000024077623,0.00096333487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99776566,0.00002563763,0.00085369917,0.0003697082,0.00029539832,0.0006899197],"domain_scores_gemma":[0.99795395,0.00014137011,0.0002599715,0.0012549123,0.000267559,0.00012222286],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00051371293,0.00032686684,0.00038288048,0.0004254986,0.00053783116,0.00031786985,0.0018200582,0.0003605667,0.0000111311365],"category_scores_gemma":[0.000071658535,0.0003166388,0.0001839628,0.0007903356,0.0001646506,0.00066236267,0.00077127444,0.00042822096,0.0000515116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028666112,0.000376319,0.0010318907,0.00024893277,0.00026266216,0.0000025583636,0.0043545538,0.0012012826,0.00005962117,0.93346274,0.023593437,0.03537736],"study_design_scores_gemma":[0.003575851,0.00020746012,0.0016962739,0.00019576648,0.00007898657,0.00007408077,0.0013798833,0.8325423,0.0011351982,0.05803815,0.10008921,0.0009868643],"about_ca_topic_score_codex":0.000012157576,"about_ca_topic_score_gemma":0.00001875555,"teacher_disagreement_score":0.87542456,"about_ca_system_score_codex":0.00014139195,"about_ca_system_score_gemma":0.00015955149,"threshold_uncertainty_score":0.9999286},"labels":[],"label_agreement":null},{"id":"W7110237132","doi":"10.4230/lipics.icalp.2025.72","title":"k-Leaf Powers Cannot Be Characterized by a Finite Set of Forbidden Induced Subgraphs for k ≥ 5","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke; McGill University","funders":"","keywords":"Chordal graph; Split graph; Interval graph; Finite set; Maximal independent set; Distance-hereditary graph; Induced subgraph; Indifference graph; Block graph","score_opus":0.019879752102609588,"score_gpt":0.270310551007324,"score_spread":0.2504307989047144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110237132","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53844976,0.00025572669,0.4397012,0.0037536535,0.0033800714,0.0061781965,0.0045915395,0.0006795314,0.0030103307],"genre_scores_gemma":[0.9610837,0.00005592789,0.03058431,0.005181914,0.000028556979,0.00073120545,0.0013181092,0.00005516128,0.0009611179],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99674886,0.000043315824,0.0014942819,0.00041316613,0.00045708957,0.00084326573],"domain_scores_gemma":[0.9970835,0.00037217376,0.0006878386,0.001047617,0.00060354144,0.00020533762],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008786705,0.00045058972,0.0007085855,0.0006425653,0.0003308229,0.00029849578,0.0014639172,0.00030199817,0.000009430556],"category_scores_gemma":[0.00017439351,0.0004133616,0.00044163692,0.00087393454,0.0001273591,0.0011104272,0.00040818367,0.00030764408,0.000011066467],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002903886,0.002778863,0.010412465,0.012178797,0.00391279,0.00001300142,0.056030713,0.00026636155,0.059433002,0.49845633,0.24949153,0.10412225],"study_design_scores_gemma":[0.034843247,0.0028478305,0.0006179127,0.0016262837,0.00039662104,0.000037707086,0.0031283798,0.16502851,0.09250153,0.04361114,0.65210074,0.0032600726],"about_ca_topic_score_codex":0.000057394944,"about_ca_topic_score_gemma":0.000013850407,"teacher_disagreement_score":0.4548452,"about_ca_system_score_codex":0.00006275431,"about_ca_system_score_gemma":0.00021047036,"threshold_uncertainty_score":0.9998318},"labels":[],"label_agreement":null},{"id":"W7110237504","doi":"10.4230/lipics.sat.2025.31","title":"On Top-Down Pseudo-Boolean Model Counting","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Supercomputing Centre Singapore; National University of Singapore; Natural Science Foundation of Jilin Province","keywords":"Variable (mathematics); Heuristic; Succinctness; Natural number; Boolean data type; Decision model; Counting problem","score_opus":0.014797032479863376,"score_gpt":0.26863978398109745,"score_spread":0.2538427515012341,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110237504","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046557028,0.000024223305,0.9237546,0.0008277081,0.0008011211,0.0005194923,0.00008766124,0.00041037085,0.027017847],"genre_scores_gemma":[0.9134468,0.000022236274,0.077765055,0.006604196,0.00007319409,0.00009712342,0.00007479746,0.000029321656,0.0018873031],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971216,0.000029377865,0.0010349815,0.0004316853,0.0005179522,0.00086444325],"domain_scores_gemma":[0.99783766,0.00018169203,0.00029839054,0.0011583936,0.0003401586,0.00018369823],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006861293,0.0004393621,0.00044372806,0.00037852564,0.0005008373,0.00079463073,0.0018142379,0.0002543253,0.000010934649],"category_scores_gemma":[0.00013126955,0.00040374897,0.0002435782,0.00048377388,0.00008998097,0.0013871175,0.0005270529,0.0005760697,0.00017535935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000081919905,0.0003393884,0.0005833088,0.00047949757,0.00013831683,0.0000045925817,0.0049400013,0.02097175,0.00012461156,0.91167057,0.01955305,0.04111297],"study_design_scores_gemma":[0.0011591819,0.00011838696,0.000046159406,0.00028736753,0.000020320864,0.000009446866,0.00016390228,0.9598237,0.0008521181,0.032225814,0.004858781,0.00043480875],"about_ca_topic_score_codex":0.000014421906,"about_ca_topic_score_gemma":0.000006502603,"teacher_disagreement_score":0.93885195,"about_ca_system_score_codex":0.00015228847,"about_ca_system_score_gemma":0.00023482167,"threshold_uncertainty_score":0.99984145},"labels":[],"label_agreement":null},{"id":"W7110276226","doi":"10.4230/lipics.approx/random.2025.22","title":"Directed Buy-At-Bulk Spanners","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research; National Science Foundation","keywords":"Sublinear function; Approximation algorithm; Randomized algorithm; Enhanced Data Rates for GSM Evolution; Online algorithm; Terminal (telecommunication); Spanner; Time complexity","score_opus":0.011666012322819446,"score_gpt":0.2558468628575314,"score_spread":0.24418085053471195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110276226","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07207584,0.00028589217,0.8375034,0.0034736535,0.006607995,0.0022792772,0.000584696,0.002440292,0.07474897],"genre_scores_gemma":[0.6305254,0.00019696826,0.3388415,0.011577537,0.00048597745,0.0005926001,0.0009398713,0.0001178871,0.016722234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99699503,0.000046653073,0.0010619962,0.00043120616,0.00051712396,0.0009480142],"domain_scores_gemma":[0.99757564,0.00025759265,0.00031468636,0.0013116442,0.00031887318,0.00022155365],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005153509,0.00045632868,0.0005162843,0.0005597161,0.0007407208,0.0005535299,0.0022318605,0.0002317006,0.00005067646],"category_scores_gemma":[0.00013630629,0.000431763,0.00037438385,0.0011356149,0.00020512647,0.0013654828,0.0013817985,0.0004330503,0.00019875451],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030780566,0.0013641336,0.008600652,0.0017604653,0.0011209256,0.00003945447,0.016245736,0.0006154761,0.00027762193,0.6297158,0.16157368,0.17837824],"study_design_scores_gemma":[0.0038808414,0.00022152014,0.0025647867,0.00031530112,0.000057405963,0.000058445243,0.00040107875,0.34492713,0.002791075,0.01570222,0.62804466,0.0010355094],"about_ca_topic_score_codex":0.00003048196,"about_ca_topic_score_gemma":0.000044539134,"teacher_disagreement_score":0.6140136,"about_ca_system_score_codex":0.00022607803,"about_ca_system_score_gemma":0.00013174689,"threshold_uncertainty_score":0.99981344},"labels":[],"label_agreement":null},{"id":"W7110327960","doi":"10.4230/lipics.approx/random.2025.42","title":"On the Spectral Expansion of Monotone Subsets of the Hypercube","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Monotone polygon; Upper and lower bounds; Hypercube; Spectral properties; Spectral gap; Mixing (physics)","score_opus":0.03513197230663311,"score_gpt":0.32015924855122824,"score_spread":0.2850272762445951,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110327960","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9567487,0.000045153716,0.023573194,0.00062732375,0.0011359375,0.0017164428,0.0003006853,0.000043481938,0.015809033],"genre_scores_gemma":[0.9813353,0.00003318926,0.016543997,0.00076908636,0.000068658635,0.0000938664,0.00002329172,0.000035863308,0.0010967514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99764884,0.0001282744,0.001196783,0.00015971992,0.00046329104,0.0004031046],"domain_scores_gemma":[0.99674785,0.001154513,0.00058507815,0.0011888794,0.0002657987,0.00005789762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013038439,0.00030597093,0.0005641977,0.0001556935,0.00019825628,0.000035035217,0.0008444331,0.00018497623,0.000027407346],"category_scores_gemma":[0.0008979353,0.00016991321,0.0004823363,0.00039226055,0.0002274455,0.00016104404,0.0002818388,0.00037954788,6.027066e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066536956,0.00087440707,0.0020556669,0.0032385734,0.00058480713,0.0000015366644,0.015163761,0.00012771525,0.003794718,0.9242803,0.038562115,0.010651046],"study_design_scores_gemma":[0.016501533,0.0016666079,0.0046258657,0.006522329,0.0012554199,0.000065935375,0.024208156,0.09306962,0.5273746,0.25975546,0.06263626,0.0023182228],"about_ca_topic_score_codex":0.0000175953,"about_ca_topic_score_gemma":0.000019837673,"teacher_disagreement_score":0.66452485,"about_ca_system_score_codex":0.00007374463,"about_ca_system_score_gemma":0.00009652299,"threshold_uncertainty_score":0.692886},"labels":[],"label_agreement":null},{"id":"W7110328884","doi":"10.4230/lipics.esa.2025.67","title":"Compact Representation of Semilinear and Terrain-Like Graphs","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fonds De La Recherche Scientifique - FNRS; McGill University","keywords":"Bipartite graph; Bounded function; Indifference graph; Complete bipartite graph; 1-planar graph; Intersection graph; Chordal graph; Simple (philosophy); Intersection (aeronautics)","score_opus":0.013114473344465449,"score_gpt":0.28407635634429196,"score_spread":0.2709618829998265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110328884","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30676407,0.00012333329,0.68744564,0.000528787,0.0008391159,0.0006818676,0.000088145396,0.00010507526,0.0034239714],"genre_scores_gemma":[0.96821374,0.000037236805,0.030219894,0.000823666,0.00003148965,0.000020407118,0.00024013921,0.00000785319,0.00040555006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985059,0.000035654954,0.00071917195,0.00020780881,0.00028151038,0.0002499817],"domain_scores_gemma":[0.998764,0.00019617604,0.00026242906,0.00041656097,0.00028062286,0.00008020787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003465115,0.00018032554,0.00028106858,0.000424592,0.00018865483,0.00017306287,0.00042345605,0.00009258644,0.0000052529463],"category_scores_gemma":[0.000080354475,0.00017145408,0.00012328058,0.0007117752,0.000079260426,0.0009888654,0.00018589386,0.00013478934,0.0000060558878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044423473,0.0014133204,0.08595471,0.0033456301,0.0011535892,0.000007767478,0.043579366,0.016801825,0.0054093413,0.583107,0.061742097,0.1970411],"study_design_scores_gemma":[0.0050769686,0.00047564466,0.027535025,0.0002976202,0.000074580414,0.000049949158,0.0011803878,0.8822955,0.015718957,0.021410381,0.04523228,0.0006527371],"about_ca_topic_score_codex":0.000018237595,"about_ca_topic_score_gemma":0.000007817755,"teacher_disagreement_score":0.86549366,"about_ca_system_score_codex":0.00003323079,"about_ca_system_score_gemma":0.00007595315,"threshold_uncertainty_score":0.69916946},"labels":[],"label_agreement":null},{"id":"W7110338092","doi":"10.4230/lipics.esa.2025.75","title":"An Improved Bound for Plane Covering Paths","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University; University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds De La Recherche Scientifique - FNRS; Agence Nationale de la Recherche; National Science Foundation","keywords":"Path (computing); Plane (geometry); Upper and lower bounds; Point (geometry); Set (abstract data type); Simple (philosophy)","score_opus":0.009719720804736804,"score_gpt":0.2711440292397116,"score_spread":0.2614243084349748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110338092","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06541774,0.000045085442,0.9299866,0.00027720278,0.0015639644,0.0010946344,0.00026657927,0.00019409359,0.0011541153],"genre_scores_gemma":[0.8252386,0.00001802355,0.1690694,0.0028005692,0.00029415544,0.0003530272,0.0013752043,0.0000262483,0.0008247883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982255,0.000021955988,0.0007267783,0.0002945507,0.00023977658,0.00049144006],"domain_scores_gemma":[0.9985209,0.00020380785,0.00023139514,0.00058780384,0.0003228998,0.00013319132],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053439883,0.00025995678,0.00028074373,0.00030816387,0.00046866995,0.0007452057,0.0008723746,0.00014195082,0.000006027271],"category_scores_gemma":[0.000090526584,0.0002561463,0.00015636814,0.00039175304,0.00003856695,0.00189955,0.00019738295,0.00016016171,0.00001665706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00081757363,0.0017062942,0.0026752048,0.0032969567,0.00077124767,0.0000069671837,0.0153001305,0.022772888,0.009646013,0.4841325,0.032472514,0.4264017],"study_design_scores_gemma":[0.0025771067,0.00039172164,0.0005083938,0.000067692425,0.000024383278,0.000013247439,0.00020239592,0.86926335,0.005251375,0.006269711,0.11504727,0.00038333333],"about_ca_topic_score_codex":0.000008730635,"about_ca_topic_score_gemma":0.000016189762,"teacher_disagreement_score":0.8464905,"about_ca_system_score_codex":0.000108870525,"about_ca_system_score_gemma":0.00018477201,"threshold_uncertainty_score":0.9999891},"labels":[],"label_agreement":null},{"id":"W7110343338","doi":"10.4230/lipics.concur.2025.19","title":"Time for Timed Monitorability","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Nondeterministic algorithm; Undecidable problem; Decidability; Automaton; Property (philosophy); Model checking; Finite-state machine; Temporal logic","score_opus":0.015610811169329131,"score_gpt":0.3057536024058803,"score_spread":0.2901427912365512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110343338","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022738725,0.00003470955,0.96489257,0.00058815355,0.0018172888,0.0023806507,0.00024672877,0.00045394557,0.0068472107],"genre_scores_gemma":[0.062299646,0.000009941311,0.932726,0.001332414,0.00015498465,0.0008243427,0.0002622846,0.00003585037,0.0023544917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99721265,0.00007360421,0.0012128408,0.00039454055,0.00037038853,0.0007360065],"domain_scores_gemma":[0.9970051,0.0004005755,0.00040104386,0.0014972864,0.0005431098,0.00015290295],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001712877,0.00036316755,0.00046998824,0.0003190301,0.00043457185,0.0004146687,0.001958893,0.0002763732,0.000016647775],"category_scores_gemma":[0.00062743324,0.0003433901,0.0003099232,0.00059299474,0.00017681133,0.0020314583,0.00047449957,0.00028821602,0.00019951542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00095395284,0.0019568296,0.0048877057,0.005156364,0.00087028835,0.000002571,0.019407222,0.00096201216,0.0017948046,0.4751994,0.08755892,0.40124992],"study_design_scores_gemma":[0.002838782,0.00029908118,0.0012759814,0.00014423089,0.000039932485,0.000009609391,0.0002910319,0.7759815,0.011213912,0.012030481,0.1952567,0.000618794],"about_ca_topic_score_codex":0.000005126296,"about_ca_topic_score_gemma":0.0000012632185,"teacher_disagreement_score":0.77501947,"about_ca_system_score_codex":0.0002494002,"about_ca_system_score_gemma":0.00017207001,"threshold_uncertainty_score":0.99990183},"labels":[],"label_agreement":null},{"id":"W7110347528","doi":"10.4230/lipics.socg.2025.69","title":"Computing Betti Tables and Minimal Presentations of Zero-Dimensional Persistent Homology","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Université de Sherbrooke","funders":"Engineering and Physical Sciences Research Council; University of Oxford; National Science Foundation","keywords":"Betti number; Persistent homology; Topological data analysis; Homology (biology); Simplicial homology; Simplicial complex; Singular homology; Bottleneck","score_opus":0.014067612155145789,"score_gpt":0.2670925453594432,"score_spread":0.2530249332042974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110347528","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4273801,0.0004113016,0.5663712,0.0015668866,0.00046766398,0.000509028,0.0005416057,0.000093182534,0.0026590044],"genre_scores_gemma":[0.945942,0.000019085659,0.052570786,0.0006611401,0.000022040143,0.000015667198,0.00026413947,0.00000521903,0.00049990945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982183,0.000039690723,0.0008032453,0.0002570589,0.0002742118,0.000407496],"domain_scores_gemma":[0.99849296,0.00042893455,0.00028844108,0.0004353338,0.00024657793,0.00010777894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036838796,0.00019883164,0.0004164967,0.00052962353,0.00030118413,0.00014808649,0.0007502645,0.00012338479,0.000020727713],"category_scores_gemma":[0.00016715257,0.00016350261,0.0002225798,0.0008662339,0.00023213623,0.00061673066,0.00090999634,0.0001693851,0.000010062651],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025244718,0.0024500722,0.18417645,0.0020418505,0.0033902326,0.00002378065,0.011954565,0.0068002837,0.00033856378,0.57144266,0.09991976,0.117209315],"study_design_scores_gemma":[0.006621144,0.0011211793,0.06298671,0.00023854163,0.00054129364,0.00015161975,0.0033480774,0.82218784,0.0013248406,0.012344397,0.08797266,0.0011617221],"about_ca_topic_score_codex":0.00005244855,"about_ca_topic_score_gemma":0.000006450309,"teacher_disagreement_score":0.81538755,"about_ca_system_score_codex":0.000021955897,"about_ca_system_score_gemma":0.000057752703,"threshold_uncertainty_score":0.66674435},"labels":[],"label_agreement":null},{"id":"W7110382014","doi":"10.4230/lipics.itcs.2025.20","title":"Estimating Euclidean Distance to Linearity","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bounded function; Estimator; Function (biology); Oracle; Euclidean distance; Linearity; Upper and lower bounds; Euclidean geometry","score_opus":0.01426574667479549,"score_gpt":0.28729682927286787,"score_spread":0.2730310825980724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110382014","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012523401,0.00003260351,0.9744439,0.0013850419,0.002546366,0.0008497359,0.00017513525,0.0004157411,0.007628088],"genre_scores_gemma":[0.21072227,0.0000048515317,0.78357714,0.00436827,0.0001898231,0.000138693,0.000091288035,0.000023442099,0.0008842053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99728286,0.00003470862,0.001052449,0.0004003671,0.0004382295,0.00079137494],"domain_scores_gemma":[0.9977694,0.00024663832,0.0002455776,0.0011959431,0.00030423992,0.00023815634],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007112267,0.00036878843,0.00044510653,0.0003735272,0.0006552172,0.00082005764,0.0021485894,0.0001425919,0.000013498008],"category_scores_gemma":[0.00029394586,0.00035999832,0.0002498909,0.0010587901,0.00010778223,0.0013324055,0.0011186185,0.0004392645,0.00011271679],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001053239,0.0006655566,0.0068836734,0.0014358382,0.00026505705,0.00001413616,0.012140872,0.0031398463,0.000046191515,0.6854836,0.03026023,0.2595597],"study_design_scores_gemma":[0.0012992077,0.00014474482,0.0012431733,0.00037970734,0.000019084553,0.000015504937,0.00022768773,0.8106537,0.00050365954,0.021787046,0.16315863,0.0005678849],"about_ca_topic_score_codex":0.00002484059,"about_ca_topic_score_gemma":0.00003801803,"teacher_disagreement_score":0.80751383,"about_ca_system_score_codex":0.00012828333,"about_ca_system_score_gemma":0.00011189407,"threshold_uncertainty_score":0.9998852},"labels":[],"label_agreement":null},{"id":"W7110393708","doi":"10.4230/lipics.stacs.2025.60","title":"Modular Counting CSP: Reductions and Algorithms","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Modulo; Constraint satisfaction problem; Automorphism; Prime (order theory); Counting problem; Modular design; Focus (optics); Binary number; Binary tree","score_opus":0.0078069332054348396,"score_gpt":0.24956541262937426,"score_spread":0.2417584794239394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110393708","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014699944,0.000048370406,0.9754194,0.0014449243,0.0012435365,0.0005517374,0.00006213091,0.0002646458,0.006265307],"genre_scores_gemma":[0.643428,0.00017161497,0.35172153,0.0023721585,0.00015085611,0.00014175681,0.00019833106,0.000028468083,0.0017872326],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985239,0.000022166152,0.0006246466,0.00023896022,0.00022807893,0.00036225747],"domain_scores_gemma":[0.9989211,0.000081516606,0.00019973758,0.00045048338,0.00024722985,0.00009996063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003707036,0.00021001558,0.00023385047,0.00032380785,0.00049679837,0.00053912605,0.00039271617,0.00012934685,0.000017306129],"category_scores_gemma":[0.00009032928,0.0002097514,0.000096276686,0.0004491753,0.00010553158,0.0016130357,0.0002489596,0.00022535527,0.000021280932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046731053,0.00034289778,0.012541278,0.0008982992,0.00046308478,0.0000056207905,0.0119964825,0.005604677,0.0003883432,0.3595513,0.011907733,0.5962535],"study_design_scores_gemma":[0.0016679792,0.000056257504,0.0042291298,0.00013062,0.000033038905,0.00006534016,0.00091574213,0.9050597,0.00043159374,0.0026788511,0.084351905,0.00037984585],"about_ca_topic_score_codex":0.000013673217,"about_ca_topic_score_gemma":0.00000896498,"teacher_disagreement_score":0.899455,"about_ca_system_score_codex":0.00008291999,"about_ca_system_score_gemma":0.00009337843,"threshold_uncertainty_score":0.8553414},"labels":[],"label_agreement":null},{"id":"W7110396286","doi":"10.4230/lipics.itcs.2025.33","title":"Bosonic Quantum Computational Complexity","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Institute for Quantum Information and Matter, California Institute of Technology; Agence Nationale de la Recherche; National Science Foundation","keywords":"Quantum computer; Quantum complexity theory; Quantum algorithm; Quantum; Upper and lower bounds; Adiabatic quantum computation; Complexity class; Quantum information; Observable; Hilbert space","score_opus":0.015383896801927179,"score_gpt":0.2703875122554101,"score_spread":0.2550036154534829,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110396286","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07996093,0.00007154073,0.9119952,0.0019978308,0.0013548511,0.00074749463,0.00018194222,0.0005188062,0.003171411],"genre_scores_gemma":[0.74797416,0.000009393904,0.24711765,0.003962612,0.00017072764,0.00006738211,0.00029059194,0.000031346335,0.00037610918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970733,0.0000611047,0.0011027606,0.0004127503,0.0005213998,0.0008286994],"domain_scores_gemma":[0.99797094,0.00031770943,0.00035548845,0.0008441602,0.0003267831,0.00018491292],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059807155,0.0004249639,0.0005056656,0.00040551208,0.00073056464,0.00065284,0.0018602441,0.00018106478,0.0000143688285],"category_scores_gemma":[0.000084187566,0.00038577136,0.00031543756,0.0007204865,0.00020975315,0.00077385944,0.0008706813,0.0005578779,0.00010121186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008066682,0.0005083526,0.0014795237,0.0008578337,0.00033521643,0.000009334255,0.004494763,0.025359193,0.000016111822,0.92406017,0.015144947,0.027653903],"study_design_scores_gemma":[0.0015909093,0.00012253496,0.0021965906,0.00017636725,0.000015577012,0.000039304512,0.000113431954,0.8891976,0.000073555435,0.07644893,0.029638346,0.0003868519],"about_ca_topic_score_codex":0.00001960451,"about_ca_topic_score_gemma":0.000007877978,"teacher_disagreement_score":0.86383843,"about_ca_system_score_codex":0.00012243868,"about_ca_system_score_gemma":0.00024375849,"threshold_uncertainty_score":0.9998594},"labels":[],"label_agreement":null},{"id":"W7110402696","doi":"10.4230/lipics.socg.2025.20","title":"Polynomial-Time Algorithms for Contiguous Art Gallery and Related Problems","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Ottawa; Carleton University; University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada; Trafikverket; Vetenskapsrådet; National Science Foundation","keywords":"Boundary (topology); Simple polygon; Polygon (computer graphics); Visibility polygon; Piecewise linear function; Merge (version control); Time complexity; Simple (philosophy); Piecewise","score_opus":0.009852901843521469,"score_gpt":0.2450447533529187,"score_spread":0.23519185150939723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110402696","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018483344,0.00016263839,0.9666638,0.0019013447,0.0017422953,0.0023877574,0.00020108264,0.00030532439,0.008152441],"genre_scores_gemma":[0.45233607,0.00021262927,0.4712635,0.0068769073,0.0006129719,0.0015909389,0.0035220475,0.00012350608,0.0634614],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801564,0.000028293465,0.0009071481,0.00032284606,0.00024952882,0.00047651542],"domain_scores_gemma":[0.99859244,0.00024310665,0.00027832272,0.0004123842,0.0003427486,0.00013098694],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062466797,0.0002850395,0.00036762582,0.00038711698,0.0003918891,0.0004942486,0.00053806906,0.00018999208,0.000012487549],"category_scores_gemma":[0.000109384964,0.0002745321,0.00016962859,0.00045480652,0.00007344106,0.0012131926,0.00026928712,0.00018424653,0.00007144253],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031782806,0.0010995885,0.0010948502,0.002431248,0.0014127909,0.0000073968795,0.011633312,0.010389506,0.0019187912,0.047255527,0.54794765,0.3744915],"study_design_scores_gemma":[0.0037177226,0.00026702948,0.0005279425,0.00014001936,0.000038599275,0.000044401128,0.000077551354,0.7077219,0.00079453544,0.0032710058,0.28298977,0.00040952838],"about_ca_topic_score_codex":0.0000029998816,"about_ca_topic_score_gemma":0.0000027859928,"teacher_disagreement_score":0.6973324,"about_ca_system_score_codex":0.00007498708,"about_ca_system_score_gemma":0.00014564523,"threshold_uncertainty_score":0.9999707},"labels":[],"label_agreement":null},{"id":"W7110406114","doi":"10.4230/lipics.aft.2025.19","title":"Two-Tier Black-Box Blockchains and Application to Instant Layer-1 Payments","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Purdue University; National Science Foundation","keywords":"Liveness; Reputation; Hash function; Blockchain; Database transaction; Payment; Byzantine fault tolerance; Cryptography; Gas meter prover","score_opus":0.00716331538222529,"score_gpt":0.262070683163895,"score_spread":0.25490736778166967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110406114","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15135063,0.00006261686,0.8356272,0.003594082,0.00018992243,0.001946402,0.0001369915,0.00042127288,0.0066709067],"genre_scores_gemma":[0.9501074,0.00003496692,0.045434047,0.0033796318,0.00002763051,0.0006247824,0.000065014465,0.000017609966,0.00030891073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978441,0.000022876318,0.00081108906,0.0004493211,0.00027703802,0.0005956019],"domain_scores_gemma":[0.99799055,0.00008260678,0.00023286503,0.0012815305,0.00022723526,0.00018520508],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048464755,0.000330126,0.0003626279,0.00046777283,0.00046213748,0.0002549916,0.0013325681,0.0002492999,0.0000037946502],"category_scores_gemma":[0.00004454856,0.00031353201,0.000100215526,0.00088333595,0.00017125666,0.00045031478,0.00095682923,0.00035154255,0.00007672073],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039858332,0.00039661385,0.0035534997,0.00023895067,0.0001393437,0.0000013912664,0.0049096807,0.00016463402,0.00044160383,0.91165817,0.0035325687,0.0749237],"study_design_scores_gemma":[0.004848304,0.00031831017,0.00233819,0.00018173685,0.000068687004,0.000029770445,0.0014146594,0.33268383,0.009129551,0.035445485,0.61245453,0.0010869402],"about_ca_topic_score_codex":0.00002586023,"about_ca_topic_score_gemma":0.00004535319,"teacher_disagreement_score":0.87621266,"about_ca_system_score_codex":0.00012579035,"about_ca_system_score_gemma":0.00007803144,"threshold_uncertainty_score":0.9999317},"labels":[],"label_agreement":null},{"id":"W7110406314","doi":"10.4230/lipics.icalp.2025.37","title":"Satisfiability of Commutative vs. Non-Commutative CSPs","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; UK Research and Innovation","keywords":"Satisfiability; Boolean satisfiability problem; Constraint satisfaction problem; Hilbert space; Commutative property; Maximum satisfiability problem; Dimension (graph theory)","score_opus":0.011625649098114992,"score_gpt":0.31388914808129603,"score_spread":0.30226349898318106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110406314","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.121075675,0.000051921303,0.8606558,0.00063625345,0.0004413055,0.002005866,0.0005016054,0.00017947091,0.014452119],"genre_scores_gemma":[0.91068554,0.000021524693,0.08787629,0.00073254685,0.000019009805,0.00022591192,0.00011246306,0.000025200368,0.00030150442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996344,0.00022635722,0.0014738297,0.0003990204,0.0006730089,0.00088381045],"domain_scores_gemma":[0.9950536,0.001471951,0.000583813,0.001768567,0.0009260704,0.00019598358],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016526207,0.0004511402,0.00081152626,0.0006127443,0.0004526657,0.00021748302,0.0028538513,0.00020558888,0.000024060602],"category_scores_gemma":[0.0005375067,0.0004123279,0.00035020875,0.0013537782,0.00074195303,0.0021329364,0.0015252666,0.00074207893,0.00005529808],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013180303,0.001868116,0.037921626,0.0038250776,0.0012662435,0.00001420244,0.086087584,0.0016077919,0.00074494234,0.76367515,0.0067267437,0.094944514],"study_design_scores_gemma":[0.016446773,0.0025750336,0.025942253,0.0014170698,0.00013988726,0.000048708305,0.014170435,0.34551492,0.07092189,0.49131805,0.02912692,0.0023780828],"about_ca_topic_score_codex":0.000036198282,"about_ca_topic_score_gemma":0.00002285401,"teacher_disagreement_score":0.78960985,"about_ca_system_score_codex":0.00025050738,"about_ca_system_score_gemma":0.00028954822,"threshold_uncertainty_score":0.99983287},"labels":[],"label_agreement":null},{"id":"W7110410286","doi":"10.4230/lipics.approx/random.2025.40","title":"Sublinear Space Graph Algorithms in the Continual Release Model","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Sublinear function; Differential privacy; Vertex (graph theory); Graph; Logarithm; Leverage (statistics); Graph property; Upper and lower bounds","score_opus":0.02049912437843991,"score_gpt":0.2819945060479404,"score_spread":0.2614953816695005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110410286","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02911513,0.0001368636,0.94024,0.022862293,0.00072705664,0.0013766034,0.00042389755,0.0007044435,0.00441366],"genre_scores_gemma":[0.33770853,0.00021082474,0.6553126,0.005467422,0.00007681371,0.00040145958,0.00035140797,0.000043860648,0.0004270711],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968348,0.00007360963,0.0010728925,0.00045378285,0.0006165201,0.00094837724],"domain_scores_gemma":[0.99180114,0.0003745791,0.00032554826,0.0071722353,0.00023603629,0.000090445246],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0015039621,0.0004168935,0.0004470212,0.00067461777,0.00032287766,0.00074615335,0.025713807,0.00032086836,0.0000037897535],"category_scores_gemma":[0.004654172,0.00032383515,0.00021186093,0.0015023262,0.00024901633,0.0023795988,0.021406984,0.0008977865,0.000045325436],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015097408,0.00094899285,0.0057705683,0.00085174706,0.00023564049,0.00004431629,0.0073290206,0.001565646,0.00004460036,0.17372581,0.75956506,0.0497676],"study_design_scores_gemma":[0.0018250262,0.000075448705,0.00023479163,0.00012628273,0.00001597486,0.000018804823,0.0007739236,0.88425547,0.00044203506,0.0874972,0.024379384,0.00035564968],"about_ca_topic_score_codex":0.000044739903,"about_ca_topic_score_gemma":0.000039572355,"teacher_disagreement_score":0.88268983,"about_ca_system_score_codex":0.00013467397,"about_ca_system_score_gemma":0.00017682296,"threshold_uncertainty_score":0.9999214},"labels":[],"label_agreement":null},{"id":"W7110418722","doi":"10.4230/lipics.icalp.2025.10","title":"On the Complexity of Telephone Broadcasting from Cacti to Bounded Pathwidth Graphs","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Chordal graph; Bounded function; Pathwidth; Vertex (graph theory); Cactus; Simple (philosophy); Indifference graph; Broadcasting (networking); Clique-sum","score_opus":0.038594561658899726,"score_gpt":0.26846180345618703,"score_spread":0.2298672417972873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110418722","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40662026,0.000043476768,0.5779939,0.002730577,0.0017461088,0.0015899854,0.0008626045,0.00027406658,0.008138991],"genre_scores_gemma":[0.9130776,0.000009471157,0.08207694,0.0044257236,0.000060758983,0.00010321773,0.00010422392,0.000021517064,0.000120569355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99707353,0.0000832201,0.0011476595,0.00038678956,0.00062084873,0.00068792823],"domain_scores_gemma":[0.99672073,0.00088296196,0.00043255033,0.0014778706,0.00031928907,0.00016660984],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007038046,0.00040855195,0.0005575379,0.00043884278,0.000709644,0.0004620556,0.002452371,0.00014279202,0.000038970382],"category_scores_gemma":[0.0003070804,0.00031708725,0.00035348258,0.0012422021,0.00041548794,0.00067355105,0.0009806281,0.00050713506,0.000053372274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000161065,0.0005183586,0.0012414276,0.00022615967,0.00031089148,0.000003732501,0.009289864,0.00016693665,0.00027056044,0.9453501,0.008262938,0.03419794],"study_design_scores_gemma":[0.004330869,0.0007360124,0.009893387,0.0010626431,0.000076334036,0.000017412754,0.0021534418,0.17997302,0.013306576,0.74713254,0.04013789,0.0011798919],"about_ca_topic_score_codex":0.00025884825,"about_ca_topic_score_gemma":0.00010490609,"teacher_disagreement_score":0.5064573,"about_ca_system_score_codex":0.00010108483,"about_ca_system_score_gemma":0.00012376782,"threshold_uncertainty_score":0.9999281},"labels":[],"label_agreement":null},{"id":"W7110422314","doi":"10.4230/lipics.wads.2025.42","title":"The Parameterized Landscape of Labeled Graph Contractions","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Parameterized complexity; Treewidth; Graph; Degeneracy (biology); Contraction (grammar); Computational complexity theory; Upper and lower bounds","score_opus":0.012420816385483684,"score_gpt":0.2946825092797038,"score_spread":0.2822616928942201,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110422314","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1368522,0.0002792274,0.8488662,0.0013691807,0.0012075766,0.0019251747,0.00023718987,0.00027711046,0.008986109],"genre_scores_gemma":[0.9660991,0.00021662666,0.03135638,0.00063248136,0.000036929498,0.00036342425,0.00006786693,0.000025036885,0.0012021434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99758524,0.00009519747,0.00097131205,0.0002250011,0.0004338154,0.00068941363],"domain_scores_gemma":[0.996564,0.0012490974,0.00037306768,0.0012163294,0.00048021265,0.00011731172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010118783,0.00025332381,0.00039468572,0.0003784001,0.0006626877,0.0003524986,0.0019230813,0.00013230422,0.000007717614],"category_scores_gemma":[0.0003939505,0.0001814775,0.00028446515,0.0010359504,0.00030044996,0.0010857517,0.0004726201,0.0004129282,0.000026345468],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005816965,0.0004474631,0.0049625696,0.00043562992,0.0006705761,0.000003583268,0.0025108282,0.00024763859,0.0012675314,0.9412102,0.0059546554,0.041707646],"study_design_scores_gemma":[0.021641174,0.0012044078,0.0050567645,0.0006244234,0.00018185169,0.00008526053,0.0049847374,0.2353651,0.027339345,0.3443714,0.35742941,0.0017161325],"about_ca_topic_score_codex":0.000005651178,"about_ca_topic_score_gemma":0.000010685334,"teacher_disagreement_score":0.82924694,"about_ca_system_score_codex":0.0000435326,"about_ca_system_score_gemma":0.00012906315,"threshold_uncertainty_score":0.74004376},"labels":[],"label_agreement":null},{"id":"W7110448534","doi":"10.4230/lipics.tqc.2025.8","title":"Self-Testing in the Compiled Setting via Tilted-CHSH Inequalities","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; HORIZON EUROPE Framework Programme; European Commission","keywords":"Inequality; International comparisons; Context (archaeology); Term (time); Linear inequality","score_opus":0.015925200414967294,"score_gpt":0.26137567154417535,"score_spread":0.24545047112920806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110448534","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14408453,0.0001025814,0.7922285,0.0020415671,0.0013452347,0.002248933,0.00010496486,0.00094784965,0.056895815],"genre_scores_gemma":[0.91934586,0.000015563912,0.071874835,0.008260902,0.00006996179,0.00022275228,0.00013796563,0.00001774619,0.000054437904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967591,0.000121628254,0.0015757043,0.00022718383,0.00054818887,0.0007681701],"domain_scores_gemma":[0.9974711,0.0007348193,0.0004973249,0.0008833181,0.00032426845,0.000089159985],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017906151,0.00037058527,0.00039127085,0.0006695883,0.00056066824,0.0009392614,0.0020461597,0.00016817551,0.000007451873],"category_scores_gemma":[0.00019758726,0.0002889862,0.00021859449,0.0016335847,0.0000896196,0.0024567875,0.00045482712,0.00054452114,0.00007355566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008281575,0.0007965461,0.055138793,0.0030590447,0.00030381893,0.000013428468,0.1338882,0.00048812354,0.000034479246,0.7281228,0.012642114,0.06542984],"study_design_scores_gemma":[0.0033118853,0.0001776086,0.0072962986,0.0004300979,0.000032775624,0.00007020571,0.00904682,0.8837418,0.00028519798,0.010334244,0.08458125,0.0006918059],"about_ca_topic_score_codex":0.000022389946,"about_ca_topic_score_gemma":0.000017319562,"teacher_disagreement_score":0.8832537,"about_ca_system_score_codex":0.0000910259,"about_ca_system_score_gemma":0.00013077827,"threshold_uncertainty_score":0.99995625},"labels":[],"label_agreement":null},{"id":"W7111085514","doi":"10.4230/lipics.fsttcs.2025.40","title":"Improved Upper Bounds on Multiflow-Multicut Gaps in Cactus Graphs","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Upper and lower bounds; Rounding; Graph; Cactus; Set (abstract data type); Path (computing); Graph theory","score_opus":0.010337931241448365,"score_gpt":0.2653205778688018,"score_spread":0.2549826466273534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7111085514","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5322283,0.00027935076,0.42255846,0.0032754845,0.010540968,0.005146132,0.0007448551,0.0012892113,0.023937255],"genre_scores_gemma":[0.92242676,0.000078341036,0.07100477,0.0047897515,0.00009979668,0.00034544812,0.00020454406,0.000047716676,0.0010028967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964233,0.00006269327,0.0013398395,0.0005442943,0.0004918276,0.0011380349],"domain_scores_gemma":[0.9974602,0.0003668461,0.00029900967,0.001419524,0.00023950609,0.00021491919],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006808814,0.0005658946,0.00061377016,0.0011409482,0.00048578865,0.00071514444,0.0020917596,0.00030439554,0.000023437817],"category_scores_gemma":[0.00017285057,0.0005251256,0.00043141618,0.001227931,0.00020768901,0.0014936881,0.0007238091,0.0007802999,0.00008142584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008798638,0.004644002,0.031005565,0.0025573536,0.0008956384,0.00006666082,0.03286326,0.0011343822,0.00073237316,0.63149863,0.018471366,0.2752509],"study_design_scores_gemma":[0.00992988,0.0005853313,0.010508616,0.00074819016,0.000043684104,0.00003105913,0.0010125514,0.85193247,0.0034516493,0.02211472,0.09820569,0.001436159],"about_ca_topic_score_codex":0.00010443419,"about_ca_topic_score_gemma":0.00014491142,"teacher_disagreement_score":0.8507981,"about_ca_system_score_codex":0.00023180257,"about_ca_system_score_gemma":0.00016240364,"threshold_uncertainty_score":0.99972004},"labels":[],"label_agreement":null},{"id":"W875360987","doi":"10.4230/dagrep.3.2.1","title":"Fault Prediction, Localization, and Repair (Dagstuhl Seminar 13061)","year":2013,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Software Engineering Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Universität des Saarlandes; University College London; Case Western Reserve University; Institut national de recherche en informatique et en automatique (INRIA); Universidade do Porto; University of Waterloo; Oregon State University","keywords":"Debugging; Computer science; Program slicing; Program comprehension; Redundancy (engineering); Software engineering; Symbolic execution; Software bug; Software; Programming language; Machine learning; Software system; Operating system","score_opus":0.008543873323558932,"score_gpt":0.23112702938986382,"score_spread":0.22258315606630488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W875360987","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10216127,0.00016658196,0.8915165,0.00054420135,0.0009945418,0.0018827267,0.00014772297,0.0017923615,0.0007941078],"genre_scores_gemma":[0.88715965,0.00019550027,0.10720215,0.0015808975,0.00039829095,0.00089418906,0.00040805707,0.00013391608,0.002027365],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99681824,0.000041459036,0.0010218762,0.0004473046,0.0007735722,0.0008975427],"domain_scores_gemma":[0.9970095,0.00043460846,0.00021811876,0.0011572217,0.00077118824,0.0004093473],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00067927263,0.00041307617,0.00038608906,0.00040069976,0.00043947113,0.00073878997,0.0011126823,0.00026579836,0.00004956875],"category_scores_gemma":[0.00072341907,0.00038454068,0.00016395899,0.0006819234,0.00016224923,0.003165361,0.00070106686,0.00042415946,0.00029470152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008106688,0.00090392074,0.41135585,0.00404845,0.0008488427,0.000029134162,0.036293272,0.0069127544,0.00023732737,0.024219565,0.47147655,0.04359328],"study_design_scores_gemma":[0.0021621992,0.00042157734,0.02287602,0.00022184398,0.000026610338,0.00016980343,0.000605069,0.8117258,0.00062926783,0.0010414806,0.15936737,0.0007529655],"about_ca_topic_score_codex":0.000044588825,"about_ca_topic_score_gemma":0.0000041911717,"teacher_disagreement_score":0.804813,"about_ca_system_score_codex":0.0001628329,"about_ca_system_score_gemma":0.00009651597,"threshold_uncertainty_score":0.99986064},"labels":[],"label_agreement":null}]}